First-Order Logic Chap8 1. Pros and Cons of Prop. Logic
|
|
- Julian Wilcox
- 5 years ago
- Views:
Transcription
1 Chapter8 First-Order Logic Chap8 1 Pros and Cons of Prop. Logic PL is declarative Knowledge and inference are separate and inference is entirely domain-independent. PL is compositional Meaning of a sentence is a function of the meaning of its parts PL allows partial/ disjunctive/negated information The meaning of PL is context-independent. PL has very limited expressive power e.g. cannot say pits cause breezes in adjacent squares except by writing one sentence for each square Chap8 2 1
2 First-Order Logic PL assumes world contains facts. FOL= PL + predicates, quantifiers, variables, and equality FOL assumes the world contains Objects: things with individual identities e.g. people, numbers, blocks A, B, C, D Properties: distinguishing objects from others e.g. red, round, prime, smelly, Inter-relations among objects - Functions : a special kind of relation in which there is only one value for a given input. e.g. father of, best friend, one more than, - Relations e.g. brother of, bigger than, on(d, A), on(a, Table), Chap8 3 Logics in General Ontological Commitment: What it assums about the nature of reality. Epistemological Commitment: The possible states of knowledge that it allows wrt each fact Chap8 4 2
3 Examples: Conceptualization One plus two equals three - Objects: one, two, three, one plus two - Function: plus - Relation: equals Squares neighboring the wumpus are smelly - Objects: wumpus, square - Property: smelly - Relations: neighboring Evil King John ruled England in Objects: John, England, Properties: evil, king - Relations: ruled All NTU students and their parents are smart Chap8 5 Models for FOL: Example 5 objects: Richard, John, 2 binary relations: brother, on head 3 unary relations: person, king, crown 1 unary function: left leg Chap8 6 3
4 Syntax of FOL Sentence Atomic Complex Complex (Sentence) Sentence Atomic Predicate( Term, K ) Term = Term Term Function(T erm, K ) Connective Quantifier Constant A X Sentence Constant Variable John Variable a x sk Connective Quantifier Variable, K Sentence Predicate Before HasColor Raining L K Functio n Mother LeftLegOf 1 Sentence L Chap8 7 Semantics of FOL Sentences are true with respect to a model and an interpretation. Model contains objects and relations among them. Interpretation specifies referents for constant symbols objects predicate symbols relations function symbols functional relations An atomic sentence Predicate(Term 1, Term n ) is true iff the objects referred to by Term 1, Term n are in the relation referred to by Predicate Chap8 8 4
5 Sentences and Terms Sentence: represent a fact - Atomic sentence: a predicate symbol followed by a parenthesized list of terms. i.e. Predicate(Term, ) - Complex sentence: constructed via logical connectives - Quantified sentence: expressing properties of entire collections of objects, rather than having enumerate the objects by name. Term: represent an object - Constant (0-ary function constant) - Variable (0-ary function variable) - Function(Term, ) Chap8 9 Sentences and Terms (cont.) Interpretation: - Each constant names exactly one object. - Not all objects have names. - Some objects have multiple names. - A relation is defined as a set of tuples of objects that satisfy it, e.g. the relation of brotherhood {< King John, Richard the Lionheart>, <Richard the Lionheart, King John>} - An n-ary function maps n objects into another object Chap8 10 5
6 FOL Examples Wendy is tall. Durante s nose is big. John loves his dog. tall(wendy) big(nose - of(durante)) loves(john,dog - of(john)) John is the brother of Richard and vice versa. Brother(Richard,John) Brother(John,Richard) Chap8 11 FOL Examples (cont.-1) All kings are persons. x Kings(x) Persons(x) x Kings(x) Persons(x) correct wrong All the following must be true: (correct) Richard is a king Richard is a person. King John is a king King John is a person. Richard s left leg is a king Richard s left leg is a person. John s left leg is a king John s left leg is a person. The crown is a king The crown is a person. (wrong) Richard is a king Richard is a person. King John is a king King John is a person. Richard s left leg is a king Richard s left leg is a person. John s left leg is a king John s left leg is a person. The crown is a king The crown is a person Chap8 12 6
7 FOL Examples (cont.-2) King John has a crown on his head. x Crown(x) OnHead(x,John) x Crown(x) OnHead(x,John) correct wrong At least one of the following must be true: (correct) Richard is a crown Richard is on John s head. King John is a crown King John is on John s head. Richard s left leg is a crown Richard s left leg is on John s head. John s left leg is a crown John s left leg is on John s head. The crown is a crown The crown is on John s head. (wrong) Richard is a crown Richard is on John s head. King John is a crown King John is on John s head. Richard s left leg is a crown Richard s left leg is on John s head John s left leg is a crown John s left leg is on John s head. The crown is a crown The crown is on John s head Chap8 13 Representing Sentences in FOL One plus two equals three. Squares neighboring the wumpus are smelly. Evil King John ruled England in Spot is a cat. All cats are mammals. Spot has a sister who is a cat. A person's brother has that person as a sibling. Everybody loves somebody. There is someone who is loved by everyone. Everyone likes ice cream. There is no one who does not like ice cream. Spot has at least two sisters Chap8 14 7
8 Compound Sentences Negation loves(john,dog - of(john)) Conjunction Disjunction loves(john,dog - of(john)) loves(john,country - of(john)) i [odd( i) even( i)] Implication loves(john,country - of(john)) loves(john,dog - of(john)) The truth or falsity of a compound sentence s can be determined from the truth or falsity of the component sentences of s. atoms + logical connectives Predicate Logic Chap8 15 Quantification Universal quantification - the sentence remains true for all values of the variable. loves(john,everything) - John loves everything. x. loves(john,x) - Everything loves everything. x. y. loves(x,y) xy. loves(x, y) - John loves all fuzzy things. x. fuzzy(x) loves(john,x) - All numbers are either odd or even. i [odd(i) even(i)] Existential quantification - the sentence is true for some value(s) of the variable. - John loves something. x. loves(john,x) Chap8 16 8
9 Quantifiers Quantifiers and can be thought of as the infinitary versions of and respectively. A sentence x. p(x) holds in a model M if and only if p(z) holds for every object Z in the domain of discourse. Similarly, a sentence x. p(x) holds in a model M if and only if there is some object Z for which p is valid. (Ex1) If a person is the parent of another person, then the other person is the child of the person. (Ex2) Everybody loves somebody. x, y Parent(x, y) Child(y, x) x y Loves(x, y) (Ex3) There is someone who is loved by everyone. x y Loves(y, x) Chap8 17 Quantifiers (cont.) de Morgan's Laws For any two sentences p and q, the following two expressions are equivalent. (p q) p q Similarly, the following two are equivalent. (p q) p q Negation involving quantifiers x P x P x P x P x P x P x P x P Chap8 18 9
10 Compositional Semantics Given a model M, FOL allows us to determine whether a sentence φ is true or false relative to an interpretation I and a variable assignment U. The truth/falsity of any atom is defined by M. φ φ is true in M iff is not true in M. a a1 is true iff is true in M and is true in M. 1 a 2 a 1 is true iff at least one of and is true in M. 1 a 2 a 2 a a Chap8 19 A common mistake to avoid Typically, is the main connective with Common mistake: using as the main connective with e.g. Everyone at NUS is smart. x At(x,NUS) Smart(x) --- (O) x At(x,NUS) Smart(x) --- (X) means Everyone is at NUS and everyone is smart Chap
11 A common mistake to avoid Typically, is the main connective with Common mistake: using as the main connective with e.g. Everyone at NUS is smart. x At(x,NUS) Smart(x) --- (O) x At(x,NUS) Smart(x) --- (X) means Everyone is at NUS and everyone is smart Chap8 21 Another common mistake to avoid Typically, is the main connective with Common mistake: using as the main connective with e.g. Someone at NUS is smart. x At(x,NUS) Smart(x) --- (O) x At(x,NUS) Smart(x) --- (X) is true if there is anyone who is not at NUS! Chap
12 Equality Equality: make statements to the effect that two terms refer to the same object. Father(Joh n) = Henry (Ex1) Spot has at least two sisters. x,y Sister(Spot, x) Sister(Spot, y) x,y Sister(Spot, x) Sister(Spot, y) (x = y) (Ex2) There is exactly one King. x King(x) y King(y) x = y! x King(x) wrong correct Chap8 23 Extensions Higher-order logic - quantify over relations and functions e.g. x, y (x = y) ( p p(x) p(y)) Two objects are equal if and only if all properties applied to them are equivalent. e.g. f, g (f = g) ( x f(x) = g(x)) Two functions are equal if and only if they have the same value for all arguments. Lambda calculus - introduce anonymous functions e.g. 2 2 (λλxy x y )(25,24) Uniqueness quantifier:! = = Chap
13 Using First-Order Logic The kinship domain - One s mother is one s female parent. m, c Mather(c) = m Female(m) Parent(m, c) - One s husband is one s male spouse. w, h Husband(h, w) Male(h) Spouse(h,w ) - A sibling is another child of one s parent. x, y Sibling(x, y) x y p Parent(p, x) Parent(p, y) Chap8 25 Using First-Order Logic(cont.-1) The set domain Constant: {} Unary predicate: Set Binary predicate: x s (member) s 1 s 2 (subset) Binary functions: s 1 s 2 (intersection) s 1 s 2 (union) {x s} (adjoin) The only sets are empty set and those made by adjoining something to a set. s Set(s) (s = {}) ( x,s2 Set(s2) s = {x The empty set has no elements adjoined into it. x, s {x s } = {} s2 }) A set is a subset of another if and only if all of the first set s members are members of the second set. s1, s2 s1 s2 ( x x s1 x s2) Chap
14 Interacting with FOL KB Suppose a wumpus-world agent is using an FOL KB And perceives a stench and a breeze, glitter at t = 5 Tell(KB, percept([stench, Breeze, Glitter, None, None], 5)) Ask(KB, a BestAction(a, 5)) Does the KB entail any particular actions at t = 5? Answer: Yes, {a/grab} Ask(KB, S) returns some/all σ (substitution, binding list) such that KB = Sσ Chap8 27 KB for the Wumpus World Percept t, s, g,m, c Percept([s, Breeze, g, m, c], t) Breeze(t) t, s, b,m, c Percept([s, b, Glitter, m, c], t) Glitter(t) Reflex t Glitter(t) BestAction(Grab, t) Environment x, y, a, b Adjacent([x,y], [a,b]) [a,b] {[x+1, y], [x-1, y], [x, y+1] [x, y-1]} Properties of locations s, t At(Agent, s, t) Breeze(t) Breezy(s) Chap
15 KB for the Wumpus World (cont.) Locations are breezy near a pit. - Diagnostic rules (infer cause from effect) s Breezy(s) r Adjacent(r, s) Pit(r) - Causal rules (infer effect from cause) r Pit(r) [ s Adjacent(r, s) Breezy(s)] s [ r Adjacent(r, s) Pit(r) ] Breezy(s) Chap8 29 Knowledge Engineering in FOL 1. Identify the task 2. Assemble the relevant knowledge 3. Decide on a vocabulary of predicates, functions, and constants 4. Encode general knowledge about the domain 5. Encode a description of the specific problem instance 6. Pose queries to the inference procedure and get answers 7. Debug the knowledge base Chap
16 The Electronic Circuits Domain One-bit full adder Chap8 31 The Electronic Circuits Domain (cont.-1) Identify the task Does the circuit actually add properly? (circuit verification) Assemble the relevant knowledge Composed of wires and gates; Types of gates (AND, OR, XOR, NOT) Connections between terminals Irrelevant: size, shape, color, cost of gates Decide on a vocabulary Alternatives: Type(X 1 ) = XOR Type(X 1, XOR) XOR(X 1 ) Chap
17 The Electronic Circuits Domain (cont.-2) Encode general knowledge of the domain - t 1,t 2 Connected(t 1, t 2 ) Signal(t 1 ) = Signal(t 2 ) - t Signal(t) = 1 Signal(t) = t 1,t 2 Connected(t 1, t 2 ) Connected(t 2, t 1 ) - g Type(g) = OR Signal(Out(1,g)) = 1 n Signal(In(n,g)) = 1 - g Type(g) = AND Signal(Out(1,g)) = 0 n Signal(In(n,g)) = 0 - g Type(g) = XOR Signal(Out(1,g)) = 1 Signal(In(1,g)) Signal(In(2,g)) - g Type(g) = NOT Signal(Out(1,g)) Signal(In(1,g)) Chap8 33 The Electronic Circuits Domain (cont.-3) Encode the specific problem instance Type(X 1 ) = XOR Type(A 1 ) = AND Type(O 1 ) = OR Type(X 2 ) = XOR Type(A 2 ) = AND Connected(Out(1,X 1 ),In(1,X 2 )) Connected(In(1,C 1 ),In(1,X 1 )) Connected(Out(1,X 1 ),In(2,A 2 )) Connected(In(1,C 1 ),In(1,A 1 )) Connected(Out(1,A 2 ),In(1,O 1 )) Connected(In(2,C 1 ),In(2,X 1 )) Connected(Out(1,A 1 ),In(2,O 1 )) Connected(In(2,C 1 ),In(2,A 1 )) Connected(Out(1,X 2 ),Out(1,C 1 )) Connected(In(3,C 1 ),In(2,X 2 )) Connected(Out(1,O 1 ),Out(2,C 1 )) Connected(In(3,C 1 ),In(1,A 2 )) Chap
18 The Electronic Circuits Domain (cont.-4) Pose queries to the inference procedure What are the possible sets of values of all the terminals for the adder circuit? i 1,i 2,i 3,o 1,o 2 Signal(In(1,C_1)) = i 1 Signal(In(2,C 1 )) = i 2 Signal(In(3,C 1 )) = i 3 Signal(Out(1,C 1 )) = o 1 Signal(Out(2,C 1 )) = o 2 Debug the knowledge base May have omitted assertions like Chap8 35 Summary First-order logic: - objects and relations are semantic primitives - syntax: constants, functions, predicates, equality, quantifiers Increased expressive power sufficient to define wumpus world Chap
First-Order Logic. Chapter 8
First-Order Logic Chapter 8 1 Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL 2 Pros and cons of propositional logic Propositional logic is declarative
More informationFirst-Order Logic. Chapter 8
First-Order Logic Chapter 8 Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL Pros and cons of propositional logic Propositional logic is declarative
More informationFirst-Order Logic. Chapter 8
First-Order Logic Chapter 8 Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL Pros/cons of propositional logic Propositional logic is declarative (recall
More informationKnowledge Representation using First-Order Logic (Part III)
Knowledge Representation using First-Order Logic (Part III) This lecture: R&N Chapters 8, 9 Next lecture: Chapter 13; Chapter 14.1-14.2 (Please read lecture topic material before and after each lecture
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 informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificial Intelligence Spring 2007 Lecture 9: Logical Agents 2 2/13/2007 Srini Narayanan ICSI and UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell or Andrew Moore
More informationFirst-Order Logic. CS367 ARTIFICIAL INTELLIGENCE Chapter 8
First-Order Logic CS367 ARTIFICIAL INTELLIGENCE Chapter 8 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell, http://aima.cs.berkeley.edu/instructors.html 1 Outline Why FOL? Syntax
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 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 informationFirst-Order Logic. Michael Rovatsos. University of Edinburgh R&N: February Informatics 2D
First-Order Logic R&N: 8.1-8.3 Michael Rovatsos University of Edinburgh 4 February 2016 Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Pros and cons of propositional logic Propositional
More informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More informationCS 771 Artificial Intelligence. First order Logic
CS 771 Artificial Intelligence First order Logic Pros and cons of propositional logic Propositional logic is declarative - Knowledge and inference are separate - Inference is domain independent Propositional
More informationJ Propositional logic is declarative J Propositional logic is compositional: q meaning of B 1,1 P 1,2 is derived from meaning of B 1,1 and of P 1,2
Propositional logic First-Order Logic Russell and Norvig Chapter 8 J Propositional logic is declarative J Propositional logic is compositional: meaning of B 1,1 P 1,2 is derived from meaning of B 1,1 and
More informationFirst-Order Logic. Propositional logic. First Order logic. First Order Logic. Logics in General. Syntax of FOL. Examples of things we can say:
Propositional logic First-Order Logic Russell and Norvig Chapter 8 Propositional logic is declarative Propositional logic is compositional: meaning of B 1,1 P 1,2 is derived from meaning of B 1,1 and of
More informationLogical Agents. Propositional Logic [Ch 6] Syntax, Semantics, Entailment, Derivation. Predicate Calculus Representation [Ch 7]
Logical Agents Reasoning [Ch 6] Propositional Logic [Ch 6] Syntax Semantics Entailment Derivation Predicate Calculus Representation [Ch 7] Syntax Semantics Expressiveness... Situation Calculus Predicate
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 informationFirst-order logic. Chapter 8. Chapter 8 1
First-order logic Chapter 8 Chapter 8 1 Outline Why FOL? Syntax and semantics of FOL Fun with sentences Wumpus world in FOL Chapter 8 2 Pros and cons of propositional logic Propositional logic is declarative:
More informationFirst-order logic. First-order logic. Logics in general. Outline. Syntax of FOL: Basic elements. Pros and cons of propositional logic
First-order logic Whereas propositional logic assumes world contains facts, first-order logic (like natural language) assumes the world contains First-order logic Chapter 8 Objects: people, houses, numbers,
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 informationFirst-order logic. Chapter 8. Chapter 8 1
First-order logic Chapter 8 Chapter 8 1 (Slides borrowed from Stuart Russel: http://aima.eecs.berkeley.edu/slides-tex/) Chapter 8 2 First-order logic Whereas propositional logic assumes world contains
More informationCS 380: ARTIFICIAL INTELLIGENCE FIRST ORDER LOGIC. Santiago Ontañón
CS 380: ARTIFICIAL INTELLIGENCE FIRST ORDER LOGIC Santiago Ontañón so367@drexel.edu Pros and cons of propositional logic Propositional logic is declarative: pieces of syntax correspond to facts Propositional
More informationRN, Chapter 8 Predicate Calculus 1
Predicate Calculus 1 RN, Chapter 8 Logical Agents Reasoning [Ch 6] Propositional Logic [Ch 7] Predicate Calculus Representation [Ch 8] Syntax, Semantics, Expressiveness Example: Circuits Inference [Ch
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 informationCSC242: Intro to AI. Lecture 12. Tuesday, February 26, 13
CSC242: Intro to AI Lecture 12 Quiz Stop Time: 2:15 ULW First draft due Mar 1 8-10 pages minimum First-Order Logic First-Order Logic Propositional Logic Syntax & Semantics Truth tables Model checking
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 informationFormal Logic. The most widely used formal logic method is FIRST-ORDER PREDICATE LOGIC
Formal Logic The most widely used formal logic method is FIRST-ORDER PREDICATE LOGIC Reference: Chapter Two The predicate Calculus Luger s Book Examples included from Norvig and Russel. CS 331 Dr M M Awais
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 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 informationFirst Order Logic. Philipp Koehn. 8 October 2015
First Order Logic Philipp Koehn 8 October 2015 Wittgenstein: Tractatus Logico-Philosophicus 1 1. The world is everything that is the case. 2. What is the case (a fact) is the existence of states of affairs.
More informationKnowledge Representation Logic and Inference Propositional Logic First-order logic Vumpus World
Knowledge Representation Logic and Inference Propositional Logic First-order logic Vumpus World 1 Assume that We design an intelligent agent (travel agent, driving agent, ) What is an intelligent agent?
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 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 informationKR: First Order Logic - Intro
KR: First Order Logic - Intro First order logic (first order predicate calculus, predicate calculus) is a higherlevel logic than propositional logic The basic components of FOL are 1. Objects 2. Relations
More informationCS 1571 Introduction to AI Lecture 14. First-order logic. CS 1571 Intro to AI. Midterm
CS 1571 Introduction to AI Lecture 14 First-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Midterm The midterm for the course will be held on October 28, 2014 In class exam Closed book
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More informationFirst-Order Logic. Language of FOL: Grammar. 22c:145 Artificial Intelligence. Norvig. Universal quantification. A common mistake to avoid
Language of FOL: Grammar 22c:145 Artificial Intelligence Sentence ::= AtomicS ComplexS AtomicS ::= True False RelationSymb(Term,...) Term = Term ComplexS ::= (Sentence) Sentence Connective Sentence Sentence
More informationLogic III. Introduction to Artificial Intelligence CSE 150
Logic III Introduction to Artificial Intelligence CSE 150 Outline Last Lecture Propositional Logic and Sound inference rules Introduction First order logic Symbols, Variables, Functions, Predicates This
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 informationDomain Modelling: An Example (LOGICAL) DOMAIN MODELLING. Modelling Steps. Example Domain: Electronic Circuits (Russell/Norvig)
(LOGICAL) DOMAIN MODELLING Domain Modelling: An Example Provision of a formal, in particular logical language for knowledge representation. Application of these means to represent the formal structure
More informationLogical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14
0/0/4 Knowledge based agents Logical Agents Agents need to be able to: Store information about their environment Update and reason about that information Russell and Norvig, chapter 7 Knowledge based agents
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 informationLogic. Stephen G. Ware CSCI 4525 / 5525
Logic Stephen G. Ware CSCI 4525 / 5525 Logic How can we represent knowledge about the world in a general, reusable way? How can we use existing knowledge to gain new knowledge? Problem Solving Approaches
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 informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
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 informationOutline. Why FOL? Syntax and semantics of FOL Using FOL. Knowledge engineering in FOL
First-Order Logic Outline Why FOL? Syntax and semantics of FOL Using FOL Wumpus world in FOL Knowledge engineering in FOL Outline Knowledge-based agents Wumpus world Logic in general - models and entailment
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: 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 informationVO Grundzüge der Artificial Intelligence SS Hans Tompits Institut für Informationssysteme Arbeitsbereich Wissensbasierte Systeme
VO Grundzüge der Artificial Intelligence SS 2009 Hans Tompits Institut für Informationssysteme Arbeitsbereich Wissensbasierte Systeme Knowledge Representation Folien adaptiert nach Vorlagen von Stuart
More informationCS560 Knowledge Discovery and Management. CS560 - Lecture 3 1
CS560 Knowledge Discovery and Management Yugi Lee STB #560D (816) 235-5932 leeyu@umkc.edu www.sce.umkc.edu/~leeyu CS560 - Lecture 3 1 Logic A logic allows the axiomatization of the domain information,
More informationFirst Order Logic Semantics (3A) Young W. Lim 8/9/17
First Order Logic (3A) Young W. Lim Copyright (c) 2016-2017 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 informationReading: AIMA Chapter 9 (Inference in FOL)
10-7-2013 Review HW#4 First Order Logic (aka The Predicate Calculus) Representing knowledge in FOL Reading: AIMA Chapter 9 (Inference in FOL) Exam#1, Tuesday, October 8 th, SC166, 7:00 pm Must interpret
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 informationFirst Order Logic Semantics (3A) Young W. Lim 9/17/17
First Order Logic (3A) Young W. Lim Copyright (c) 2016-2017 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 informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
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 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 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 informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:
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 informationLecture Overview [ ] Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 6. Motivation. Logical Agents
Lecture Overview [7.1-7.4] COMP 3501 / COMP 4704-4 Lecture 6 Prof. JGH 318 Logical Agents Wumpus World Propositional Logic Inference Theorem Proving via model checking Motivation Existing techniques help
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 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 informationPlanning and search. FOL and situation calculus. FOL and situation calculus 1
Planning and search FOL and situation calculus FOL and situation calculus 1 Outline First-order logic continued Situation calculus Logic and planning FOL and situation calculus 2 Fun with sentences Brothers
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 informationFirst-Order Logic. Doug Downey Northwestern EECS 348 Intro to AI Based on slides by Stuart Russell
First-Order Logic Doug Downey Northwestern EECS 348 Intro to AI Based on slides by Stuart Russell Pros and Cons of Propositional Logic Declarative: pieces of syntax correspond to facts Allows partial/disjunctive/negated
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 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 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 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 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 informationPrinciples of Intelligent Systems: Situation Calculus
Principles of Intelligent Systems: Situation Calculus Lecture 11 These slides are based on Chapters 8 and 10 of Russell and Norvig s Artificial Intelligence: A modern approach (http://aima.eecs.berkeley.edu/slides-pdf/)
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 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 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 information7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring
109 7 LOGICAL AGENS We now turn to knowledge-based agents that have a knowledge base KB at their disposal With the help of the KB the agent aims at maintaining knowledge of its partially-observable environment
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationLogical Agents. Outline
Logical Agents *(Chapter 7 (Russel & Norvig, 2004)) Outline Knowledge-based agents Wumpus world Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability
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 informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
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 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 informationFirst-Order Logic and Inference
First-Order Logic and Inference Berlin Chen Department of Computer Science & Information Engineering National Taiwan Normal University References: 1. S. Russell and P. Norvig. Artificial Intelligence:
More informationIntroduc)on to Ar)ficial Intelligence
Introduc)on to Ar)ficial Intelligence Lecture 9 Logical reasoning CS/CNS/EE 154 Andreas Krause First order logic (FOL)! Proposi)onal logic is about simple facts! There is a breeze at loca)on [1,2]! First
More informationOutline First-order logic. First-order Logic. Introduction. Recall: 4-Queens problem. First-order Logic. First-order Logic Syntax.
First-order Logic CS 486/686 Sept 25, 2008 University of Waterloo Outline First-order logic Syntax and semantics Inference Propositionalization with ground inference Lifted resolution 1 2 Introduction
More informationInf2D 06: Logical Agents: Knowledge Bases and the Wumpus World
Inf2D 06: Logical Agents: Knowledge Bases and the Wumpus World School of Informatics, University of Edinburgh 26/01/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Outline Knowledge-based
More informationLecture 4. Predicate logic
Lecture 4 Predicate logic Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 All slides are based on CS441 Discrete
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 informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
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 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 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 informationCS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationKnowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents
Knowledge-based Agents CS 331: Artificial Intelligence Propositional Logic I Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
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 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 informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More information