First-Order Predicate Calculus
|
|
- Cory Caldwell
- 6 years ago
- Views:
Transcription
1 First-Order Predicate Calculus Deepak Kumar November 2017 Propositional Logic - Syntax Sentences Well-formed formulas (wffs) Any atom is a wff [Atomic Sentences] e.g. P, Q, R, R3 Complex Sentences If ω 1 and ω 2 are wffs, then so are ω 1 ω 1 ω 2 disjunction ω 1 ω 2 conjunction ω 1 ω 2 implication ω 1 negation There are no other wffs. Literals are atomic wffs Examples P (P Q) P P Q P P P X etc. P, P 2 1
2 Propositional Logic - Semantics How symbols relate to the domain/world Atomic Sentences Interpretation of symbols & constants True is True False is False P I : Bryn Mawr is in Pennsylvania Meaning of a symbol is its truth value, given its interpretation. P is True, given P I Complex Sentences Use meaning of connectives. 3 Propositional Logic - Key Ideas (un)satisfiability Validity Entailment (Δ ω) Inference & Theorem Proving (Δ R ω) Rules of Inference Soundness (Δ R ω implies Δ ω) Completeness (Whenever Δ ω, Δ R ω) Reductio ad Absurdum (if Δ has a model, but Δ { ω} does not, it must be that Δ ω ) Resolution rule of inference (sound, but not complete) Resolution with Reductio is sound and complete. Wffs as clauses (also, Definite and Horn clauses) Forward & Backward Chaining Inference 4 2
3 Propositional Logic - Key Ideas (un)satisfiability Validity Entailment (Δ ω) Inference & Theorem Proving (Δ R ω) Rules of Inference Soundness (Δ R ω implies Δ ω) Completeness (Whenever Δ ω, Δ R ω) Reductio ad Absurdum (if Δ has a model, but Δ { ω} does not, it must be that Δ ω ) Resolution rule of inference (sound, but not complete) Resolution with Reductio is sound and complete. Wffs as clauses (also, Definite and Horn clauses) Forward & Backward Chaining Inference Propositional Logic is not very expressive. But useful for learning the fundamentals. 5 First-Order Predicate Calculus (FOPC) Components Object constants: A, B, Deepak, etc. Function Constants: fatherof, colorof, etc. Relation Constants: Parent, On, Clear, Sibling, etc. Variables: x, y, z, u, v, w, etc. Connectives:,,, Quantifiers:, Delimiters: (, ), [, ] 6 3
4 Objects, Functions, Relations Object constants: these are objects or individuals in the domain A, B, Deepak, Red, Car54, etc. Function Constants: operate on objects and denote other objects fatherof 1, colorof 1, distance 2 etc. Relation Constants: Denote properties on, between objects Parent 2, On 2, Clear 1, Sibling 2, etc. 7 FOPC - Syntax Terms An object is a term A function constant of arity, n followed by n terms is a term (functional expression) Wffs represent propositions e.g. motherof(sally), colorof A Atomic wffs relation-constant n (term 1, term 2, term n ) e.g. Propositional wffs If ω 1 and ω 2 are wffs, then so are ω 1 ω 1 ω 2 disjunction ω 1 ω 2 conjunction ω 1 ω 2 implication ω 1 negation Parent(Ginny, Lily) 8 4
5 FOPC - Syntax Terms An object is a term A function constant of arity, n followed by n terms is a term (functional expression) Wffs represent propositions Atomic wffs e.g. Propositional wffs If ω 1 and ω 2 are wffs, then so are ω 1 e.g. motherof(sally), colorof A relation-constant( ) ω 1 ω 2 disjunction ω 1 ω 2 conjunction ω 1 ω 2 implication ω 1 negation Parent(Ginny, Lily) Save for later Variables: x, y, z, u, v, w, etc. Quantifiers:, 9 FOPC - Semantics Objects The world can have infinite objects/individuals - concrete - abstract - fictional As long as it is a name and we need to say something about it. Functions Relations Denote objects, we may not have a name for f n (o 1, o 2,, o n ) -> object Denote properties Heavy(x) On(A, B) Big(y) Clear(A) Human(Deepak) Block(A) Interpretation An atomic wff is True/False just in case the relation denoted by it holds for its arguments. 10 5
6 FOPC Example - Blocksworld Objects A, B, C, Table Relations On 2, Clear 1 On(C, Table) On(A, C) On(B, A) Clear(B) Clear(A) Clear(C) Clear(Table) Example Knowledge Base Δ = {On(C, Table), On(A, C), On(B, A), Clear(B)} B A C Table 11 FOPC Example - Blocksworld Objects A, B, C, Table Relations On 2, Clear 1 On(C, Table) On(A, C) On(B, A) Clear(B) Clear(A) Clear(C) Clear(Table) B A C Table Example Knowledge Base But, how to make general Statements about the world? Δ = {On(C, Table), On(A, C), On(B, A), Clear(B)} 12 6
7 Variables & Quantifiers Variables A variable is a term. i.e. it denotes/can denote an object. Universal Quantifier ( - for-all ) if ω is a wff and x is a variable then ( x) ω x (ω) is a wff is a wff x [ω] is a wff ω is the scope of the variable. E.g. x [ P(x) R(x) ] Existential Quantifier ( - there exists ) if ω is a wff and x is a variable then e.g. ( x) ω is a wff x [ P(x) y [ R(x, y) S(f(x) ] ] 13 Semantics of and In a given domain x ω(x) has value True Just in case ω(x) has value True for all assignments of x to objects in the domain. e.g. On 2, Clear 1 x [ On(x, C) Clear(C) ] Just in case x=a/b/c/table are True. 14 7
8 Semantics of and In a given domain x ω(x) has value True Just in case ω(x) has value True for all assignments of x to objects in the domain. e.g. On 2, Clear 1 x [ On(x, C) Clear(c) ] Just in case x=a/b/c/table are True. Similarly, x ω(x) has value True Just in case ω(x) is True for atleast one assignment for x in the domain. 15 Example Tell King(John) Tell Person(Richard) Tell x [ King(x) Person(x) ] Queries 1. King(John)? 2. x Person(x)? But, we want to know who is a person! 3. ASK-VARS(KB, Person(x)) 16 8
9 Example Tell King(John) Tell Person(Richard) Tell x [ King(x) Person(x) ] Queries 1. King(John)? True 2. x Person(x)? True But, we want to know who is a person! 3. ASK-VARS(KB, Person(x)) 17 Example Tell King(John) Tell Person(Richard) Tell x [ King(x) Person(x) ] Queries 1. King(John)? True 2. x Person(x)? True But, we want to know who is a person! 3. ASK-VARS(KB, Person(x)) x = Richard x = John 18 9
10 Example Tell King(John) Tell Person(Richard) Tell x [ King(x) Person(x) ] Queries 1. King(John)? True 2. x Person(x)? True Tell x [ King(x) Greedy(x) Evil(x) ] Tell King(John) Tell Greedy(John) Query Evil(John)? True But, we want to know who is a person! 3. ASK-VARS(KB, Person(x)) x = Richard x = John 19 Blocksworld On(x, y) : x is on top of y Clear(x) : x is clear Block(x) : x is a block On(B, A) On(A, C) On(C, Table) Block(A) Block(B) Block(C) x, y [ Block(x) Block(y) On(x, y) Clear(y) ] 20 10
11 Blocksworld On(x, y) : x is on top of y Clear(x) : x is clear Block(x) : x is a block Isa(x, y) : x is a y On(B, A) Isa(A, Block) On(A, C) Isa(B, Block) On(C, Table) Isa(C, Block) Block(A) Block(B) Block(C) x, y [ Block(x) Block(y) On(x, y) Clear(y) ] 21 Blocksworld On(x, y) : x is on top of y Clear(x) : x is clear Block(x) : x is a block Isa(x, y) : x is a y On(B, A) Isa(A, Block) On(A, C) Isa(B, Block) On(C, Table) Isa(C, Block) Block(A) Block(B) Block(C) x, y [ Isa(x, Block) Isa(y, Block) On(x, y) Clear(y) ] 22 11
12 Mrs Dursley Mr Dursley Mrs Evans Mr Evans Mr Potter Mrs Potter Septimus Cedrella Marge Vernon Petunia Lily James Arthur Molly Dudley Harry Ginny Ron George Fred Percy Charlie Bill Hermione James Albus Lily Hugo Rose 23 Mrs Dursley Mr Dursley Mrs Evans Mr Evans Mr Potter Mrs Potter Septimus Cedrella Marge Vernon Petunia Lily James Arthur Molly Predicates Dudley Harry Ginny Ron George Fred Percy Charlie Bill Hermione James Albus Lily Hugo Rose 1. Female(x) : x is female 2. Male(x) : x is male 3. Parent(x, y) : x is a parent of y 4. Married(x, y) : x is married to y 24 12
13 Mrs Dursley Mr Dursley Mrs Evans Mr Evans Mr Potter Mrs Potter Septimus Cedrella Marge Vernon Petunia Lily James Arthur Molly Predicates 1. Female(x) : x is female 2. Male(x) : x is male 3. Parent(x, y) : x is a parent of y 4. Married(x, y) : x is married to y Symbols Marge, Vernon, James1, James2, Albus, Lily, Harry, etc. Dudley Harry Ginny Ron George Fred Percy Charlie Bill James Albus Lily Female(Marge) Female(Petunia) Female(Lily) Male(James1) Male(Vernon) Etc. Hugo Hermione Rose Married(Vernon, Petunia) Married(Lily, James1) Married(Arthur, Molly) Married(Harry, Ginny) Married(Ron, Hermione) Etc. Parent(Harry, James2) Parent(Ginny, James2) Parent(Petunia, Dudley) Parent(Vernon, Dudley) Parent(Molly, Bill) Etc. 25 Mrs Dursley Mr Dursley Mrs Evans Mr Evans Mr Potter Mrs Potter Septimus Cedrella Marge Vernon Petunia Lily James Arthur Molly Predicates 1. Female(x) : x is female 2. Male(x) : x is male 3. Parent(x, y) : x is a parent of y 4. Married(x, y) : x is married to y Symbols Dudley Harry Ginny Ron George Fred Percy Charlie Bill James Albus Lily Female(Marge) Female(Petunia) Female(Lily) Male(James1) Male(Vernon) Etc. Hugo Hermione Rose Married(Vernon, Petunia) Married(Lily, James1) Married(Arthur, Molly) Married(Harry, Ginny) Married(Ron, Hermione) Etc. Parent(Harry, James2) Parent(Ginny, James2) Parent(Petunia, Dudley) Parent(Vernon, Dudley) Parent(Molly, Bill) Etc. Marge, Vernon, James1, James2, Albus, Lily, Harry, etc. Facts 26 13
14 Modeling Relationships Spouse(x, y) : x is a spouse of y Wife(x, y) : x is a wife of y Husband(x, y) Father(x, y), Mother(x, y) Sibling(x, y), Brother(x, y), Sister(x, y) GrandParent/GrandMother/GrandFather GrandChild/GrandDaughter/GrandSon Aunt/Uncle/AuntOrUncle Cousin Niece/Nephew/NieceOrNephew Child/Daughter/Son Etc. 27 Modeling Relationships Spouse(x, y) : x is a spouse of y Husband/Wife Mother/Father 28 14
15 Modeling Relationships Spouse(x, y) : x is a spouse of y x, y [Married(x, y) Spouse(x, y) ] Husband/Wife * x, y [ Female(x) Married(x, y) Wife(x, y) ] Mother/Father x, y [ Female(x) Parent(x, y) Mother(x, y) ] 29 Modeling Relationships Sibling(x, y) : x is a sibling of y x, y [[ z Father(z, x) Father(z, y)] [ w Mother(w, x) Mother(w, y)] (x y) Sibling(x, y) ] 30 15
16 Modeling Relationships Spouse(x, y) : x is a spouse of y Wife(x, y) : x is a wife of y Husband(x, y) Father(x, y), Mother(x, y) Sibling(x, y), Brother(x, y), Sister(x, y) GrandParent/GrandMother/GrandFather GrandChild/GrandDaughter/GrandSon Aunt/Uncle/AuntOrUncle Cousin Niece/Nephew/NieceOrNephew Child/Daughter/Son Etc. 31 Another Example (From R&N) Domain: people, songs, albums, disks (CDs) CopyOf(d, a) Owns(p, d) Sings(p, s, a) Wrote(p, s) : disk d is a copy of album a : person p owns disk d : album a includes recording of song s sung by p : person p wrote song s Constants: McCartney, Gershwin, Joe, EleanorRigby, TheManILove, Revolver, BillieHoliday, Joe 32 16
17 Another Example 1. Gershwin wrote The Man I Love Wrote(Gershwin, TheManILove) 2. Gershwin did not write Eleanor Rigby Wrote(Gershwin, EleanorRigby) 3. Either Gershwin or McCartney wrote The Man I Love Wrote(Gershwin, TheManILove) Wrote(McCartney, TheManILove) 4. Joe has written at least one song s Wrote(Joe, s) 5. Joe owns a copy of Revolver x CopyOf(x, Revolver) Owns(Joe, x) 33 Another Example 6. Every song that McCartney sings on revolver was written by McCartney s [Sings(McCartney, s, Revolver) Wrote(McCartney, s) ] 7. Gershwin did not write any of the songs on Revolver [ s Wrote(Gershwin, s) p Sings(p, s, Revolver) ] 8. Every song that Gershwin wrote has been recorded on some album s [ Wrote(Gershwin, s) p,a Sings(p, s, a) ] 34 17
18 Another Example 9. There is a single album that contains every song that Joe has written a [ s Wrote(Joe, s) p Sings(p, s, a) ] 10. Joe owns a copy of an album that has Billy Holiday singing The Man I Love d, a, s [CopyOf(d, a) Owns(Joe, d) Sings(BillieHoliday, TheManILove, a)] 35 Another Example 11. Joe owns a copy of every album that has a song sung by McCartney a [ s Sings(McCartney, s, a) d CopyOf(d, a) Owns(Joe, d) ] 12. Joe owns a copy of every album on which all the songs are sung by Billie Holiday a [ [ s, p Sings(p, s, a) Sings(BillieHolliday, s, a)] d CopyOf(d, a) Owns(Joe, d) ] 36 18
19 FOPC Exercise The law says that it is a crime for an American to sell weapons to hostile nations. The country Nono, an enemy of America, has some missiles, and all of its missiles were sold to it by Colonel West, who is American. Use the following relations: American(x) : x is an American Enemy(x, y) : x is an enemy of y Hostile(x) : x is hostile Criminal(x) : x is a criminal Missile(x) : x is a missile Weapon(x) : x is a weapon Owns(x, y) : x owns y Sells(x, y, z) : x sells y to z To write FOPC wffs for the following: 1. it is a crime for an American to sell weapons to hostile nations: 2. Nono has some missiles: 3. all of its missiles were sold to it by Colonel West: 4. Also, Missiles are weapons: 5. And, an enemy of America is hostile: 6. West, who is American: 7. The country Nono, an enemy of America: 37 19
Inference in First-Order Predicate Calculus
Inference in First-Order Predicate Calculus Deepak Kumar November 2017 Knowledge Engineering in FOPC Identify the task Assemble relevant knowledge Decide on a vocabulary of predicates, functions, and constants
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 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 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 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 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 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 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 informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
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 informationLogic: First Order Logic (Part I)
Logic: First Order Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
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 informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationLogic. Foundations of First Order Logic. franconi. Enrico Franconi
(1/41) Logic Foundations of First Order Logic Enrico Franconi franconi@inf.unibz.it http://www.inf.unibz.it/ franconi Faculty of Computer Science, Free University of Bozen-Bolzano (2/41) Motivation We
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 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 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 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 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 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 informationLogic-based agents. Logic Summary
Artificial Intelligence Programming Inference Chris Brooks Department of Computer Science University of San Francisco Logic-based agents The big picture: our agent needs to make decisions about what to
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 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 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 informationLogical Agents. CITS3001 Algorithms, Agents and Artificial Intelligence. 2018, Semester 2
Logical Agents CITS3001 Algorithms, Agents and Artificial Intelligence Tim French School of Computer Science and Software Engineering The University of Western Australia 2018, Semester 2 Summary We motivate
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Bernhard Nebel and Martin Riedmiller Albert-Ludwigs-Universität
More informationFirst-order logic. AI Slides (5e) c Lin
First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 6 1 6 First-Order Logic 2.1 First-order logic Syntax Semantics 2.2 Representation in FOL 2.3 Agents in first-order case AI Slides (5e) c Lin
More informationAI Programming CS S-10 First Order Logic
AI Programming CS662-2013S-10 First Order Logic David Galles Department of Computer Science University of San Francisco 10-0: Representation Propositional Logic has several nice features Lets us easily
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 informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2015 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 8 Why FOL?
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 informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
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 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: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationReasoning. Inference. Knowledge Representation 4/6/2018. User
Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world
More informationIntroduction to Artificial Intelligence. Logical Agents
Introduction to Artificial Intelligence Logical Agents (Logic, Deduction, Knowledge Representation) Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Knowledge-based
More informationDate Topic Readings Due 11/18 First-order logic Ch. 9 HW 6 11/25 First-order inference, Ch. 10 HW7 (Othello) 12/2 Planning. Chs. 11 & 12 HW8.
Today Lecture 8 Administrivia Discuss test 1 Discuss projects First order logic CS 91.420/543 Artificial Intelligence Fall 2008 Administrivia Readings for today: Nov. 18: Chs. 8 & 9 Readings for next week:
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 informationHow to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.
Major results: (wrt propositional logic) How to reason correctly. How to reason efficiently. How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague,
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationITS336 Lecture 6 First-Order Logic
ITS6 Lecture 6 First-Order Logic 6.1 Syntax for FOL Basic Elements of FOL Constant Symbols A constant is an specific object such as a person name Tom, a particular apple etc. Variable Symbols A countably
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 informationCS:4420 Artificial Intelligence
CS:4420 Artificial Intelligence Spring 2018 First-Order 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 informationLogic and Reasoning. Foundations of Computing Science. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR
Logic and Reasoning Foundations of Computing Science Pallab Dasgupta Professor, Dept. of Computer Sc & Engg 2 Knowledge and Reasoning Representation, Reasoning and Logic Propositional Logic First-Order
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 informationThe Predicate Calculus
2 The Predicate Calculus 2.0 Introduction 2.1 The Propositional Calculus 2.2 The Predicate Calculus 2.3 Using Inference Rules to Produce Predicate Calculus Expressions 2.4 Application: A Logic- Based Financial
More informationKnowledge Representation and Reasoning
Knowledge Representation and Reasoning Geraint A. Wiggins Professor of Computational Creativity Department of Computer Science Vrije Universiteit Brussel Objectives Knowledge Representation in Logic The
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 informationCS 5100: Founda.ons of Ar.ficial Intelligence
CS 5100: Founda.ons of Ar.ficial Intelligence Logical Inference Prof. Amy Sliva September 29, 2011 Outline First- order logic Review syntax and semantics Conjunctive normal form Inference in FOL Theoretical
More informationAdvanced Artificial Intelligence (SCOM7341) First Order Logic. Dr. Mustafa Jarrar
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) First Order Logic Dr. Mustafa Jarrar Sina
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
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 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 informationLecture 8: (Predicate) First Order Logic
Lecture 8: (Predicate) First Order Logic CS 580 (001) - Spring 2018 Amarda Shehu Department of Computer Science George Mason University, Fairfax, VA, USA April 04, 2018 Amarda Shehu (580) 1 1 Outline of
More information473 Topics. Knowledge Representation III First-Order Logic. Logic-Based KR. Propositional. Logic vs. First Order
473 Topics Knowledge Representation III First-Order Logic CSE 473 Perception NLP Robotics Multi-agent Inference Logic Supervised Learning Knowledge Representation Search Problem Spaces Agency Reinforcement
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More informationFirst order logic (FOL) Chapters 8 & 9
First order logic (FOL) Chapters 8 & 9 Pros and cons of propositional logic Propositional logic is declarative Propositional logic is compositional Meaning in propositional logic is context-independent
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 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 informationCS 380: ARTIFICIAL INTELLIGENCE INFERENCE IN PROPOSITIONAL LOGIC
CS 380: ARTIFICIAL INTELLIGENCE INFERENCE IN PROPOSITIONAL LOGIC 11/11/2013 Santiago Ontañón santi@cs.drexel.edu https://www.cs.drexel.edu/~santi/teaching/2013/cs380/intro.html Summary of last day: Logic:
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 informationIntroduction to Intelligent Systems
Logical Agents Objectives Inference and entailment Sound and complete inference algorithms Inference by model checking Inference by proof Resolution Forward and backward chaining Reference Russel/Norvig:
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationGS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen Anthony Hall
GS03/4023: Validation and Verification Predicate Logic Jonathan P. Bowen www.cs.ucl.ac.uk/staff/j.bowen/gs03 Anthony Hall GS03 W1 L3 Predicate Logic 12 January 2007 1 Overview The need for extra structure
More informationKecerdasan Buatan M. Ali Fauzi
Kecerdasan Buatan M. Ali Fauzi Artificial Intelligence M. Ali Fauzi Logical Agents M. Ali Fauzi In which we design agents that can form representations of the would, use a process of inference to derive
More informationIntroduction to Intelligent Systems
Logical Agents Objectives Inference and entailment Sound and complete inference algorithms Inference by model checking Inference by proof Resolution Forward and backward chaining Reference Russel/Norvig:
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 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 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 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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationNathan Sturtevant FOL
Lecture Overview COMP 3501 / COMP 4704-4 Lecture 8 First order logic (FOL) Inference in FOL Prof. JGH 318 First Order Logic FOL is closer to natural languages that prop. logic FOL contains: Objects (Constants):
More informationClass Assignment Strategies
Class Assignment Strategies ì Team- A'ack: Team a'ack ì Individualis2c: Search for possible ì Poli2cal: look at others and make decision based on who is winning, who is loosing, and conversa;on ì Emo2on
More informationARTIFICIAL INTELLIGENCE
Page1 ARTIFICIAL INTELLIGENCE UNIT-II LOGICAL REASONING Logical Agents propositional logic inferences first-order logic inferences in first-order logic forward chaining- backward chaining unification resolution
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 information22c:145 Artificial Intelligence. First-Order Logic. Readings: Chapter 8 of Russell & Norvig.
22c:145 Artificial Intelligence First-Order Logic Readings: Chapter 8 of Russell & Norvig. Einstein s Puzzle in Logic We used propositinal variables to specify everything: x 1 = house #1 is red ; x 2 =
More information(Part II) Reading: R&N Chapters 8, 9
Knowledge Representation using First-Order Logic (Part II) Reading: R&N Chapters 8, 9 Outline Review: KB = S is equivalent to = (KB S) So what does {} = S mean? Review: Follows, Entails, Derives Follows:
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 informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationInference in first-order logic. Production systems.
CS 1571 Introduction to AI Lecture 17 Inference in first-order logic. Production systems. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Sentences in Horn normal form Horn normal form (HNF) in
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 informationLogic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure
Logic Programming (PLP 11) Predicate Calculus, Horn Clauses, Clocksin-Mellish Procedure Carlos Varela Rennselaer Polytechnic Institute November 7, 2016 C. Varela 1 An Early (1971) Conversation USER: Cats
More informationDeliberative Agents Knowledge Representation II. First Order Predicate Logic
Deliberative Agents Knowledge Representation II Vasant Honavar Bioinformatics and Computational Biology Program Center for Computational Intelligence, Learning, & Discovery honavar@cs.iastate.edu www.cs.iastate.edu/~honavar/
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 informationNathan Sturtevant FOL
Lecture Overview COMP 3501 / COMP 4704-4 Lecture 8: First Order Logic First order logic (FOL) Inference in FOL Prof. JGH 318 First Order Logic FOL is closer to natural languages that prop. logic FOL contains:
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
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 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 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 informationCSC384: Intro to Artificial Intelligence Knowledge Representation II. Required Readings: 9.1, 9.2, and 9.5 Announcements:
CSC384: Intro to Artificial Intelligence Knowledge Representation II Required Readings: 9.1, 9.2, and 9.5 Announcements: 1 Models Examples. Environment A Language (Syntax) Constants: a,b,c,e Functions:
More informationChapter 8 First Order Logic
1 Chapter 8 First Order Logic BBM 405 Artificial Intelligence Pinar Duygulu Slides are mostly adapted from AIMA and MIT Open Courseware CS461 Artificial Intelligence Pinar Spring Pros and cons of propositional
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 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 information