Inference in First-Order Logic
|
|
- Herbert Mervin Oliver
- 6 years ago
- Views:
Transcription
1 Inference in First-Order Logic Dr. Richard J. Povinelli rev 1.0, 10/7/2001 Page 1
2 Objectives You should! be able to analyze and employ logical inference in first-order logic. rev 1.0, 10/7/2001 Page 2
3 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming Resolution rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 3
4 A brief history of reasoning 450B.C. Stoics: propositional logic, inference (maybe) 322B.C. Aristotle: syllogisms (inference rules), quantifiers 1565 Cardano: probability theory (propositional logic + uncertainty) 1847 Boole: propositional logic (again) 1879 Frege: first-order logic 1922 Wittgenstein: proof by truth tables 1930 Gödel: complete algorithm for FOL 1930 Herbrand complete algorithm for FOL (reduce to propositional) 1931 Gödel: complete algorithm for arithmetic 1960 Davis/Putnam practical algorithm for propositional logic 1965 Robinson: practical algorithm for FOL resolution rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 4
5 Proofs Sound inference: find α such that KB = α. Proof process is a search, operators are inference rules. Modus Ponens (MP) And-Introduction (AI) Universal Elimination (UE) τ must be a ground term (i.e., no variables) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 5
6 Example proof Bob is a buffalo Pat is a pig Buffaloes outrun pigs Prove:Bob outruns Pat 1. Buffalo(Bob) 2. Pig(Pat) 3. x, y Buffalo(x) Pig(y) Faster(x,y) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 6
7 Example proof Bob is a buffalo Pat is a pig Buffaloes outrun pigs Prove:Bob outruns Pat AI 1 & 2 1. Buffalo(Bob) 2. Pig(Pat) 3. x, y Buffalo(x) Pig(y) Faster(x,y) 4. Buffalo(Bob) Pig(Pat) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 7
8 Example proof Bob is a buffalo Pat is a pig Buffaloes outrun pigs Prove:Bob outruns Pat AI 1 & 2 UE 3, {x/bob, y/pat} 1. Buffalo(Bob) 2. Pig(Pat) 3. x, y Buffalo(x) Pig(y) Faster(x,y) 4. Buffalo(Bob) Pig(Pat) 5. Buffalo(Bob) Pig(Pat) Faster(Bob, Pat) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 8
9 Example proof Bob is a buffalo Pat is a pig Buffaloes outrun pigs Prove:Bob outruns Pat AI 1 & 2 UE 3, {x/bob, y/pat} MP 4 & 5 1. Buffalo(Bob) 2. Pig(Pat) 3. x, y Buffalo(x) Pig(y) Faster(x,y) 4. Buffalo(Bob) Pig(Pat) 5. Buffalo(Bob) Pig(Pat) Faster(Bob, Pat) 6. Faster(Bob,Pat) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 9
10 CAT Prove It Given! 1. Giraffe(Tom)! 2. Lion(Fred)! 3. x, y Giraffe(x) Lion(y) Taller(x,y) Prove that Tom is bigger than Fred Work with a partner for 5 minutes. rev 1.0, 10/7/2001 Page 10
11 Universal instantiation (UI) Every instantiation of a universally quantified sentence is entailed by it: α Subst ({ v g}, α ) for any variable v and ground term g ( ) ( ) ( ) E. g., x King x Greedy x Evil x yields ( ) ( ) ( ) ( ) ( ) ( ) ( ( )) ( ( )) ( ( )) King John Greedy John Evil John King Richard Greedy Richard Evil Richard King Father John Greedy Father John Evil Father John rev 1.0, 10/7/2001 Page 11
12 Existential instantiation (EI) For any sentence α, variable v, and constant symbol k that does not appear elsewhere in the knowledge base: v α Subst E. g., x Crown x OnHead x, John yields y ( ) ({ v k }, α ) ( ) ( ) ( ) (, ) Crown C OnHead C John y ( ) y Another example: from x d x dy = x we obtain d e dy = e 1 1 provided C is a new constant symbol, called a Skolem constant 1 y provided e is a new constant symbol rev 1.0, 10/7/2001 Page 12
13 Existential instantiation cont. UI can be applied several times to add new sentences; the new KB is logically equivalent to the old EI can be applied once to replace the existential sentence; the new KB is not equivalent to the old, but is satisfiable iff the old KB was satisfiable rev 1.0, 10/7/2001 Page 13
14 Reduction to propositional inference Suppose the KB contains just the following: x King ( x ) Greedy ( x ) Evil ( x ) King ( John ) Greedy ( John ) Brother ( Richard, John ) Instantiating the universal sentence in all possible ways, we have King ( John ) Greedy ( John ) Evil ( John ) King ( Richard ) Greedy ( Richard ) Evil ( Richard ) King ( John ) Greedy ( John ) Brother ( Richard, John ) The new KB is propositionalized: proposition symbols are King ( John ), Greedy ( John ), Evil ( John ), King ( Richard ),etc. rev 1.0, 10/7/2001 Page 14
15 Reduction cont. Claim: a ground sentence* is entailed by new KB iff entailed by original KB Claim: every FOL KB can be propositionalized so as to preserve entailment Idea: propositionalize KB and query, apply resolution, return result Problem: with function symbols, there are infinitely many ground terms,! e.g., Father(Father(Father(John))) Theorem: Herbrand (1930). If a sentence α is entailed by an FOL KB, it is entailed by a finite subset of the propositional KB Idea: For n = 0 to do! create a propositional KB by instantiating with depth-n terms! see if α is entailed by this KB Problem: works if α is entailed, loops if α is not entailed Theorem: Turing (1936), Church (1936), entailment in FOL is semidecidable rev 1.0, 10/7/2001 Page 15
16 Problems with propositionalization Propositionalization seems to generate lots of irrelevant sentences. E.g., from ( ) ( ) ( ) ( ) ( ) (, ) x King x Greedy x Evil x King John y Greedy y Brother Richard John it seems obvious that Evil(John), but propositionalization produces lots of facts such as Greedy(Richard) that are irrelevant With p k-ary predicates and n constants, there are pn k instantiations! rev 1.0, 10/7/2001 Page 16
17 Search with primitive inference rules Operators are inference rules States are sets of sentences Goal test checks state to see if it contains query sentence AI, UE, MP is a common inference pattern Problem: branching factor huge, esp. for UE Idea: find a substitution that makes the rule premise match some known facts a single, more powerful inference rule rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 17
18 Unification A substitution σ unifies atomic sentences p and q if pσ = qσ p Knows(John, x) Knows (John, x) Knows (John, x) q Knows (John, Jane) Knows (y, OJ) Knows (y, Mother(y)) σ rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 18
19 Unification A substitution σ unifies atomic sentences p and q if pσ = qσ p Knows(John, x) Knows (John, x) Knows (John, x) q Knows (John, Jane) Knows (y, OJ) Knows (y, Mother(y)) σ {x/jane} {x/john; y/oj } {y/john;x/mother(john)} Idea: Unify rule premises with known facts, apply unifier to conclusion Example: if we know q and Knows(John, x) Likes(John, x) then we conclude! Likes(John, Jane)! Likes(John, OJ)! Likes(John, Mother(John)) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 19
20 Generalized Modus Ponens (GMP) Example! p 1 = Faster(Bob,Pat)! p 2 = Faster(Pat,Steve) ( ) p 1, p2,, pn, p1 p2 pn q q, θ! p 1 p 2 q = Faster(x, y) Faster(y, z) Faster(x, z)! σ = {x/bob, y/pat, z/steve}! qσ = Faster(Bob, Steve) GMP used with KB of definite clauses (exactly one positive literal): either a single atomic sentence or (conjunction of atomic sentences) (atomic sentence) All variables assumed universally quantified where p θ = pθ for all i i i rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 20
21 Soundness of GMP Need to show that! p 1,, p n, (p 1 p n q)! qθ! provided that p i σ = p i σ for all i Lemma: For any definite clause p, we have p! pθ by UE 1. (p 1 p n q)! (p 1 p n q)θ = (p 1 θ p n θ) qθ ) 2. p 1,, p n! p 1 p n! p 1 θ p n θ 3. From 1 and 2, qθ follows by simple MP rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 21
22 Forward chaining When a new fact p is added to the KB! for each rule such that p unifies with a premise " if the other premises are known " then add the conclusion to the KB and continue chaining Forward chaining is data-driven! inferring properties and categories from percepts rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 22
23 Forward chaining example Add facts 1, 2, 3, 4, 5, 7 in turn. Number in [] = unification literal; indicates rule firing 1. Buffalo(x) Pig(y) Faster(x, y) 2. Pig(y) Slug(z) Faster(y, z) 3. Faster(x, y) Faster(y, z) Faster(x, z) 4. Buffalo(Bob) [1a, ] 5. Pig(Pat) [1b, ], [2a, ] 6. Faster(Bob, Pat) [3a, ], [3b, ] 7. Slug(Steve) [2b, ] 8. Faster(Pat, Steve) [3a, ], [3b, ] 9. Faster(Bob, Steve) [3a, ], [3b, ] rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 23
24 Backward chaining When a query q is asked! if a matching fact q is known, return the unifier! for each rule whose consequent q matches q attempt to prove each premise of the rule by backward chaining Some added complications in keeping track of the unifiers More complications help to avoid infinite loops Two versions: find any solution, find all solutions Backward chaining is the basis for logic programming, e.g., Prolog rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 24
25 Backward chaining example 1. Pig(y) Slug(z) Faster(y, z) 2. Slimy(z) Creeps(z) Slug(z) 3. Pig(Pat) 4. Slimy(Steve) 5. Creeps(Steve) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 25
26 Completeness in FOL Procedure i is complete if and only if! KB - i α whenever KB! α Forward and backward chaining are complete for Horn KBs, but incomplete for general first-order logic Example from! PhD(x) HighlyQualified(x)! PhD(x) EarlyEarnings(x)! HighlyQualified(x) Rich(x)! EarlyEarnings(x) Rich(x) should be able to infer Rich(Me) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 26
27 CAT Infer Rich(Me) Given! PhD(x) HighlyQualified(x)! PhD(x) EarlyEarnings(x)! HighlyQualified(x) Rich(x)! EarlyEarnings(x) Rich(x) Infer Rich(Me) using forward and backward chaining Work with a partner for 5 minutes. rev 1.0, 10/7/2001 Page 27
28 Completeness in FOL Were you able to infer Rich(Me)? Does a complete algorithm exist? rev 1.0, 10/7/2001 Page 28
29 Resolution Entailment in first-order logic is only semidecidable:! can find a proof of α if KB = α! cannot always prove that KB α Cf. Halting Problem: proof procedure may be about to terminate with success or failure, or may go on for ever Resolution is a refutation procedure:! to prove KB = ff, show that KB α is unsatisfiable Resolution uses KB, α in CNF (conjunction of clauses) Resolution inference rule combines two clauses to make a new one: Inference continues until an empty clause is derived (contradiction) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 29
30 Resolution inference rule Basic propositional version: Full first-order version: For example rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 30
31 Conjunctive Normal Form Literal = (possibly negated) atomic sentence, e.g., Rich(Me) Clause = disjunction of literals, e.g., Rich(Me) Unhappy(Me) The KB is a conjunction of clauses Any FOL KB can be converted to CNF as follows: 1. Replace P Q by P Q 2. Move inwards, e.g., x P becomes x P 3. Standardize variables apart, e.g., x P x Q becomes x P y Q 4. Move quantifiers left in order, e.g., x P y Q becomes x y P Q 5. Eliminate by Skolemization (next slide) 6. Drop universal quantifiers 7. Distribute over e.g., (P Q) R becomes (P Q) (P R) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 31
32 Skolemization x Rich(x) becomes Rich(G1) where G1 is a new Skolem constant More tricky when is inside Example Everyone has a heart x Person(x ) y Heart(y) Has(x, y) Incorrect:! x Person(x ) Heart(H1) Has(x, H1) Correct:! x Person(x ) Heart(H (x)) Has(x, H (x))! where H is a new symbol ( Skolem function ) Skolem function arguments: all enclosing universally quantified variables rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 32
33 Resolution proof To prove α:! negate it! convert to CNF! add to CNF KB! infer contradiction Example: to prove Rich(me), add Rich(me) to the CNF KB! PhD(x) HighlyQualified(x)! PhD(x) EarlyEarnings(x)! HighlyQualified(x) Rich(x)! EarlyEarnings(x) Rich(x) rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 33
34 Resolution proof rev 1.0, 10/7/2001 AIMA Slides Stuart Russell and Peter Norvig, 1998 Page 34
Objectives. Logical Reasoning Systems. Proofs. Outline. Example proof. Example proof. You should
Copyright Richard J. Povinelli rev 1.0, 10/1//2001 Page 1 Logical Reasoning Systems Objectives You should be able to analyze and employ logical inference in first-order logic. Dr. Richard J. Povinelli
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Resolution Chapter
More informationSyntax of FOL: Basic elements
First-order logic Chapter 7 CS 580, Jana Kosecka, Chapter 7 1 Syntax of FOL: Basic elements Constants KingJohn, 2, UCB,... Predicates Brother, >,... Functions Sqrt, Lef tlegof,... Variables x, y, a, b,...
More informationInference in first-order logic
Revised by Hankui Zhuo, March 28, 2018 Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward
More informationCS 561: Artificial Intelligence
CS 561: Artificial Intelligence Instructor: TAs: Sofus A. Macskassy, macskass@usc.edu Nadeesha Ranashinghe (nadeeshr@usc.edu) William Yeoh (wyeoh@usc.edu) Harris Chiu (chiciu@usc.edu) Lectures: MW 5:00-6:20pm,
More informationInference in First-Order Logic
A brief history of reasoning 450B.C. Stoics propositional logic, inference (maybe) 322B.C. Aristotle syllogisms (inference rules), quantifi 1565 Cardano probability theory (propositional logic + uncertainty)
More informationCS 771 Artificial Intelligence. First Order Logic Inference
CS 771 Artificial Intelligence First Order Logic Inference Universal instantiation (UI) Notation: Subst({v/g}, α) means the result of substituting ground term g for variable v in sentence α Every instantiation
More information7.5.2 Proof by Resolution
137 7.5.2 Proof by Resolution The inference rules covered so far are sound Combined with any complete search algorithm they also constitute a complete inference algorithm However, removing any one inference
More informationInference Methods In Propositional Logic
Lecture Notes, Artificial Intelligence ((ENCS434)) University of Birzeit 1 st Semester, 2011 Artificial Intelligence (ENCS434) Inference Methods In Propositional Logic Dr. Mustafa Jarrar University of
More informationOutline. Reducing first-order inference to propositional inference Unification. Forward chaining Backward chaining
Inference in First-Order Od Logic 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward chaining Backward chaining Resolution 2 Universal instantiation
More informationIntroduction to Artificial Intelligence 2 nd semester 2016/2017. Chapter 9: Inference in First-Order Logic
Introduction to Artificial Intelligence 2 nd semester 2016/2017 Chapter 9: Inference in First-Order Logic Mohamed B. Abubaker Palestine Technical College Deir El-Balah 1 Outlines Reducing first-order inference
More informationInference Methods In Propositional Logic
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Inference Methods In Propositional Logic
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming
More informationInference in first-order logic
CS 2710 Foundations of AI Lecture 15 Inference in first-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Logical inference in FOL Logical inference problem: Given a knowledge base KB
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationInf2D 11: Unification and Generalised Modus Ponens
Inf2D 11: Unification and Generalised Modus Ponens School of Informatics, University of Edinburgh 08/02/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Outline Reducing first-order
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming
More informationArtificial Intelligence Chapter 9: Inference in First-Order Logic
Artificial Intelligence Chapter 9: Inference in First-Order Logic Andreas Zell After the Textbook: Artificial Intelligence, A Modern Approach by Stuart Russell and Peter Norvig (3 rd Edition) 9 Inference
More informationLogical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5
rtificial Intelligence Topic 12 Logical Inference Reading: Russell and Norvig, Chapter 7, Section 5 c Cara MacNish. Includes material c S. Russell & P. Norvig 1995,2003 with permission. CITS4211 Logical
More informationSet 8: Inference in First-order logic. ICS 271 Fall 2013 Chapter 9: Russell and Norvig
Set 8: Inference in First-order logic ICS 271 Fall 2013 Chapter 9: Russell and Norvig Universal instantiation (UI) Every instantiation of a universally quantified sentence is entailed by it: v α Subst({v/g},
More informationInference in first-order logic
Inference in first-order logic CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2014 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 9 Outline
More informationSet 8: Inference in First-order logic. ICS 271 Fall 2017 Chapter 9: Russell and Norvig
Set 8: Inference in First-order logic ICS 271 Fall 2017 Chapter 9: Russell and Norvig Universal instantiation (UI) Every instantiation of a universally quantified sentence is entailed by it: v α Subst({v/g},
More informationChapter 7 R&N ICS 271 Fall 2017 Kalev Kask
Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing
More informationTitle: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)
B.Y. Choueiry 1 Instructor s notes #12 Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) Introduction to Artificial Intelligence CSCE 476-876, Fall 2018 URL: www.cse.unl.edu/ choueiry/f18-476-876
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Ch. 9 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Resolution
More informationCSC242: Intro to AI. Lecture 13. Thursday, February 28, 13
CSC242: Intro to AI Lecture 13 Recap Rooms adjacent to pits will have breezes Socrates is a person All people are mortal Anybody s grandmother is either their mother s or their father s mother Elements
More informationCS 380: ARTIFICIAL INTELLIGENCE
CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS 11/8/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Summary of last day: Logical gents: The can
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming
More informationLogical Agents. Chapter 7
Logical Agents Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationIntelligent Agents. Pınar Yolum Utrecht University
Intelligent Agents Pınar Yolum p.yolum@uu.nl Utrecht University Logical Agents (Based mostly on the course slides from http://aima.cs.berkeley.edu/) Outline Knowledge-based agents Wumpus world Logic in
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationInference in first-order logic
CS 57 Introduction to AI Lecture 5 Inference in first-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Logical inference in FOL Logical inference problem: Given a knowledge base KB (a
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationProof Methods for Propositional Logic
Proof Methods for Propositional Logic Logical equivalence Two sentences are logically equivalent iff they are true in the same models: α ß iff α β and β α Russell and Norvig Chapter 7 CS440 Fall 2015 1
More informationCS 380: ARTIFICIAL INTELLIGENCE PREDICATE LOGICS. Santiago Ontañón
CS 380: RTIFICIL INTELLIGENCE PREDICTE LOGICS Santiago Ontañón so367@drexeledu Summary of last day: Logical gents: The can reason from the knowledge they have They can make deductions from their perceptions,
More informationOutline. Inference in first- order logic: just a taste. Universal instan8a8on (UI) Inference with Quan8fiers. Reduc8on to proposi8onal inference
Outline Inference in first- order logic: just a taste Dr. Melanie Mar8n CS 4480 Based on slides from hap://aima.eecs.berkeley.edu/2nd- ed/slides- ppt/ Reducing first- order inference to proposi8onal inference
More informationCS 730/730W/830: Intro AI
CS 730/730W/830: Intro AI 1 handout: slides 730W journal entries were due Wheeler Ruml (UNH) Lecture 9, CS 730 1 / 16 Logic First-Order Logic The Joy of Power Wheeler Ruml (UNH) Lecture 9, CS 730 2 / 16
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic Marc Toussaint University of Stuttgart Winter 2016/17 (slides based on Stuart Russell s AI course) Motivation: Most students will have learnt about propositional
More informationLogical Agent & Propositional Logic
Logical Agent & Propositional Logic Berlin Chen 2005 References: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 7 2. S. Russell s teaching materials Introduction The representation
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 10, 5/9/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Logical Agents Chapter 7
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (previous lecture, Part I) Chapter 7.5 (this lecture, Part II) (optional: 7.6-7.8)
More informationLogical Inference 2 rule based reasoning
Logical Inference 2 rule based reasoning Chapter 9 Some material adopted from notes by Andreas Geyer-Schulz,, Chuck Dyer, and Mary Getoor Automated inference for FOL Automated inference for FOL is harder
More informationInf2D 13: Resolution-Based Inference
School of Informatics, University of Edinburgh 13/02/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Last lecture: Forward and backward chaining Backward chaining: If Goal is known
More informationCSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13
CSC242: Intro to AI Lecture 11 Propositional Inference Propositional Inference Factored Representation Splits a state into variables (factors, attributes, features, things you know ) that can have values
More informationThe Wumpus Game. Stench Gold. Start. Cao Hoang Tru CSE Faculty - HCMUT
The Wumpus Game Stench Stench Gold Stench Start 1 The Wumpus Game Stench in the square containing the wumpus and in the directly adjacent squares in the squares directly adjacent to a pit Glitter in the
More informationPropositional Logic: Methods of Proof. Chapter 7, Part II
Propositional Logic: Methods of Proof Chapter 7, Part II Inference in Formal Symbol Systems: Ontology, Representation, ti Inference Formal Symbol Systems Symbols correspond to things/ideas in the world
More informationThe only sets are the empty set and those made by adjoining something to a set: s: Set(s) s = Ø x, s 2 : Set(s 2 ) s = { x s 2 }.
171 Axioms for sets To define sets we use: Constant symbol Ø, which refers to the empty set Unary predicate Set, which is true of sets Binary predicates x s and s 1 s 2 Binary function are s 1 Us 2, s
More informationDeliberative Agents Knowledge Representation I. Deliberative Agents
Deliberative Agents Knowledge Representation I Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
More informationGuest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1
Page 1 Guest Speaker CS 416 Artificial Intelligence Lecture 13 First-Order Logic Chapter 8 Topics in Optimal Control, Minimax Control, and Game Theory March 28 th, 2 p.m. OLS 005 Onesimo Hernandez-Lerma
More informationFirst-Order Logic. Peter Antal
First-Order Logic Peter Antal antal@mit.bme.hu 10/16/2015 1 Why FOL? Syntax and semantics of FOL Knowledge engineering in FOL Inference in FOL Reducing first-order inference to propositional inference
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic Marc Toussaint University of Stuttgart Winter 2015/16 (slides based on Stuart Russell s AI course) Outline Knowledge-based agents Wumpus world Logic in general
More information[1] Describe with examples, the three inference rules involving quantifiers
[1] Describe with examples, the three inference rules involving quantifiers The three new inference rules are as follows: 1- Universal Instantiation : For any sentence a, variable v, and ground term g
More informationLogical Agent & Propositional Logic
Logical Agent & Propositional Logic Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. S. Russell and P. Norvig. Artificial Intelligence:
More informationLecture 10: Even more on predicate logic" Prerequisites for lifted inference: Skolemization and Unification" Inference in predicate logic"
CS440/ECE448: Intro to Artificial Intelligence Lecture 10: Even more on predicate logic Prof. Julia Hockenmaier juliahmr@illinois.edu http://cs.illinois.edu/fa11/cs440 Inference in predicate logic All
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationOutline. First-order logic. Atomic sentences. Intelligent Systems and HCI D7023E. Syntax of FOL: Basic elements. Pros and cons of propositional logic
Outline Intelligent Systems and HCI D7023E Lecture 8: First-order Logic [Ch.8] Paweł Pietrzak Why FOL? Syntax and semantics of FOL Using FOL Knowledge engineering in FOL Some inference in FOL 1 Pros and
More information7. Logical Agents. COMP9414/ 9814/ 3411: Artificial Intelligence. Outline. Knowledge base. Models and Planning. Russell & Norvig, Chapter 7.
COMP944/984/34 6s Logic COMP944/ 984/ 34: rtificial Intelligence 7. Logical gents Outline Knowledge-based agents Wumpus world Russell & Norvig, Chapter 7. Logic in general models and entailment Propositional
More informationCS 730/830: Intro AI. 3 handouts: slides, asst 6, asst 7. Wheeler Ruml (UNH) Lecture 12, CS / 16. Reasoning.
CS 730/830: Intro AI 3 handouts: slides, asst 6, asst 7 Wheeler Ruml (UNH) Lecture 12, CS 730 1 / 16 Logic First-Order Logic The Joy of Power in First-order Logic Wheeler Ruml (UNH) Lecture 12, CS 730
More informationInference in first-order logic
CS 270 Foundations of AI Lecture 4 Inference in first-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square First-order logic FOL More epressive than propositional logic Advantages: Represents
More informationCSCI-495 Artificial Intelligence. Lecture 17
CSCI-495 Artificial Intelligence Lecture 17 Tractable Inference: Horn Logic Resolution in general can be exponential in space and time For tractable inference we need a smaller logic Real-world KBs often
More informationInference in Propositional Logic
Inference in Propositional Logic Deepak Kumar November 2017 Propositional Logic A language for symbolic reasoning Proposition a statement that is either True or False. E.g. Bryn Mawr College is located
More informationPropositional Reasoning
Propositional Reasoning CS 440 / ECE 448 Introduction to Artificial Intelligence Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri Spring 2010 Intro to AI (CS
More informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart
More informationFirst Order Logic (FOL) and Inference
First Order Logic (FOL) and Inference CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 13, 5/18/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Inference in first-order
More informationLogic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )
Logic in AI Chapter 7 Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz ) 2 Knowledge Representation represent knowledge about the world in a manner that
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationLogical agents. Chapter 7. Chapter 7 1
Logical agents Chapter 7 Chapter 7 1 Outline Knowledge-based agents Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference rules and theorem
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
More informationArtificial Intelligence
Artificial Intelligence First-Order Logic Marc Toussaint University of Stuttgart Winter 2015/16 (slides based on Stuart Russell s AI course) First-order logic (FOL) is exactly what is sometimes been thought
More informationCS 771 Artificial Intelligence. Propositional Logic
CS 771 Artificial Intelligence Propositional Logic Why Do We Need Logic? Problem-solving agents were very inflexible hard code every possible state E.g., in the transition of 8-puzzle problem, knowledge
More informationLogic and Inferences
Artificial Intelligence Logic and Inferences Readings: Chapter 7 of Russell & Norvig. Artificial Intelligence p.1/34 Components of Propositional Logic Logic constants: True (1), and False (0) Propositional
More informationKnowledge based Agents
Knowledge based Agents Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University Slides prepared from Artificial Intelligence A Modern approach by Russell & Norvig Knowledge Based Agents
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationResolution (14A) Young W. Lim 8/15/14
Resolution (14A) Young W. Lim Copyright (c) 2013-2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationInference in first-order logic
Inference in first-order logic Chapter 9 Chapter 9 1 Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward and backward chaining Logic programming
More informationRevised by Hankui Zhuo, March 21, Logical agents. Chapter 7. Chapter 7 1
Revised by Hankui Zhuo, March, 08 Logical agents Chapter 7 Chapter 7 Outline Wumpus world Logic in general models and entailment Propositional (oolean) logic Equivalence, validity, satisfiability Inference
More informationCS 520: Introduction to Artificial Intelligence. Review
CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg : First-order Logic Proof Algorithms 1 Review Representing a Domain in FOL A domain is a portion of the world about which we wish to
More informationPropositional Logic. Logic. Propositional Logic Syntax. Propositional Logic
Propositional Logic Reading: Chapter 7.1, 7.3 7.5 [ased on slides from Jerry Zhu, Louis Oliphant and ndrew Moore] Logic If the rules of the world are presented formally, then a decision maker can use logical
More informationLogical agents. Chapter 7. Chapter 7 1
Logical agents Chapter 7 Chapter 7 Outline Knowledge-based agents Wumpus world Logic in general models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules
More informationRational Agents. Paolo Turrini. Introduction to Artificial Intelligence 2nd Part. Department of Computing, Imperial College London
Rational Agents Department of Computing, Imperial College London Introduction to Artificial Intelligence 2nd Part What you have seen You have seen procedures for computational problem-solving: searching
More informationCOMP9414: Artificial Intelligence First-Order Logic
COMP9414, Wednesday 13 April, 2005 First-Order Logic 2 COMP9414: Artificial Intelligence First-Order Logic Overview Syntax of First-Order Logic Semantics of First-Order Logic Conjunctive Normal Form Wayne
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationTDT4136 Logic and Reasoning Systems
TDT436 Logic and Reasoning Systems Chapter 7 - Logic gents Lester Solbakken solbakke@idi.ntnu.no Norwegian University of Science and Technology 06.09.0 Lester Solbakken TDT436 Logic and Reasoning Systems
More informationLogical Agents (I) Instructor: Tsung-Che Chiang
Logical Agents (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010 編譯有誤
More informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationInference in First Order Logic
Inference in First Order Logic Course: CS40002 Instructor: Dr. Pallab Dasgupta Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Inference rules Universal elimination:
More informationResolution: Motivation
Resolution: Motivation Steps in inferencing (e.g., forward-chaining) 1. Define a set of inference rules 2. Define a set of axioms 3. Repeatedly choose one inference rule & one or more axioms (or premices)
More informationAI Programming CS S-09 Knowledge Representation
AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More informationKE/Tableaux. What is it for?
CS3UR: utomated Reasoning 2002 The term Tableaux refers to a family of deduction methods for different logics. We start by introducing one of them: non-free-variable KE for classical FOL What is it for?
More informationPropositional inference, propositional agents
ropositional inference, propositional agents Chapter 7.5 7.7 Chapter 7.5 7.7 1 Outline Inference rules and theorem proving forward chaining backward chaining resolution Efficient model checking algorithms
More informationINF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim
INF5390 Kunstig intelligens Logical Agents Roar Fjellheim Outline Knowledge-based agents The Wumpus world Knowledge representation Logical reasoning Propositional logic Wumpus agent Summary AIMA Chapter
More informationLogical Inference and Reasoning Agents. Foundations of Artificial Intelligence
Logical Inference and Reasoning Agents Foundations of Artificial Intelligence Resolution Rule of Inference i Resolution provides a complete rule of inference for first order predicate calculus 4 if used
More informationLogical Agents: Propositional Logic. Chapter 7
Logical Agents: Propositional Logic Chapter 7 Outline Topics: Knowledge-based agents Example domain: The Wumpus World Logic in general models and entailment Propositional (Boolean) logic Equivalence, validity,
More informationLogic. Knowledge Representation & Reasoning Mechanisms. Logic. Propositional Logic Predicate Logic (predicate Calculus) Automated Reasoning
Logic Knowledge Representation & Reasoning Mechanisms Logic Logic as KR Propositional Logic Predicate Logic (predicate Calculus) Automated Reasoning Logical inferences Resolution and Theorem-proving Logic
More informationPropositional Resolution
Computational Logic Lecture 4 Propositional Resolution Michael Genesereth Spring 2005 Stanford University Modified by Charles Ling and TA, for CS2209 Use with permission Propositional Resolution Propositional
More information