(Part II) Reading: R&N Chapters 8, 9
|
|
- Griselda Heath
- 6 years ago
- Views:
Transcription
1 Knowledge Representation using First-Order Logic (Part II) Reading: R&N Chapters 8, 9
2 Outline Review: KB = S is equivalent to = (KB S) So what does {} = S mean? Review: Follows, Entails, Derives Follows: Is it the case? Entails: Is it true? Derives: Is it provable? Review: FOL syntax Finish FOL Semantics, FOL examples Inference in FOL Next Tuesday (1 June) is Review/Catch-up; Homework#7 is due Next Thursday (3 June) NO CLASS; I m reviewing grants for NIH Next Friday (4 June) PROJECT REPORTS & CODE is due Following Thursday (10 June) FINAL EXAM; 1:30-3:30pm
3 Review: KB = S means = (KB S) KB = S is read KB entails S. Means S is true in every world (model) in which KB is true. Means In the world, S follows from KB. KB = S is equivalent to = (KB S) Means (KB S) is true in every world (i.e., is valid). And so: {} = S is equivalent to = ({} S) So what does ({} S) mean? Means True implies S. Means S is valid. In Horn form, means S is a fact. p. 256 (3 rd ed.; p. 281, 2 nd ed.) Why does {} mean True here, but False in resolution proofs?
4 Review: (True S) means S is a fact. By convention, The null conjunct is syntactic sugar for True. The null disjunct is syntactic sugar for False. Each is assigned the truth value of its identity element. For conjuncts, True is the identity: (A True) A For disjuncts, False is the identity: (A False) A A KB is the conjunction of all of its sentences. So in the expression: {} = S We see that {} is the null conjunct and means True. The expression means S is true in every world where True is true. I.e., S is valid. Better way to think of it: {} does not exclude any worlds (models). In Conjunctive Normal Form each clause is a disjunct. So in, say, KB = { {P Q} { Q R} {} {X Y Z} } We see that {} is the null disjunct and means False.
5 Side Trip: Functions AND, OR, and null values (Note: These are syntactic sugar in logic.) function AND(arglist) returns a truth-value return ANDOR(arglist, True) function OR(arglist) returns a truth-value return ANDOR(arglist, False) function ANDOR(arglist, nullvalue) returns a truth-value /* nullvalue is the identity element for the caller. */ if (arglist = {}) then return nullvalue if ( FIRST(arglist) = NOT(nullvalue) ) then return NOT(nullvalue) return ANDOR( REST(arglist) )
6 Review: Schematic for Follows, Entails, and Derives Inference Sentences Derives Sentence If KB is true in the real world, then any sentence entailed by KB and any sentence derived from KB by a sound inference procedure is also true in the real world.
7 Schematic Example: Follows, Entails, and Derives Inference Mary is Sue s sister and Amy is Sue s daughter. An aunt is a sister of a parent. Derives Is it provable? Mary is Amy s aunt. Mary is Sue s sister and Amy is Sue s daughter. Representation An aunt is a sister of a parent. Entails Is it true? Mary is Amy s aunt. World Mary Sister Sue Daughter Follows Is it the case? Aunt Mary Amy Amy
8 Review: Models (and in FOL, Interpretations) Models are formal worlds in which truth can be evaluated We say m is a model of a sentence α if α is true in m M(α) is the set of all models of α Then KB α iff M(KB) M(α) E.g. KB, = Mary is Sue s sister and Amy is Sue s daughter. α = Mary is Amy s aunt. Think of KB and α as constraints, t and of models m as possible states. M(KB) are the solutions to KB and M(α) the solutions to α. Then, KB α, i.e., (KB a), when all solutions to KB are also solutions to α.
9 Review: Wumpus models KB = all possible wumpus-worlds consistent with the observations and the physics of the Wumpus world.
10 Review: Wumpus models α 1 = "[1,2] is safe", KB α 1, proved by model checking. Every model that makes KB true also makes α 1 true.
11 Review: Syntax of FOL: Basic elements Constants KingJohn, 2, UCI,... Predicates Brother, >,... Functions Sqrt, LeftLegOf,... Variables x, y, a, b,... Connectives,,,, Equality = Quantifiers,
12 Syntax of FOL: Basic syntax elements are symbols Constant Symbols: Stand for objects in the world. E.g., KingJohn, 2, UCI,... Predicate Symbols Stand for relations (maps a tuple of objects to a truth-value) E.g., Brother(Richard, John), greater_than(3,2),... P(x, y) is usually read as x is P of y. E.g., Mother(Ann, Sue) is usually Ann is Mother of Sue. Function Symbols Stand for functions (maps a tuple of objects to an object) E.g., Sqrt(3), LeftLegOf(John),... Model (world) = set of domain objects, relations, functions Interpretation etation maps symbols onto the model (world) Very many interpretations are possible for each KB and world! Job of the KB is to rule out models inconsistent with our knowledge.
13 Syntax of FOL: Terms Term = logical expression that refers to an object There are two kinds of terms: Constant Symbols stand for (or name) objects: E.g., KingJohn, 2, UCI, Wumpus,... Function Symbols map tuples of objects to an object: E.g., LeftLeg(KingJohn), Mother(Mary), Sqrt(x) This is nothing but a complicated kind of name No subroutine call, no return value
14 Syntax of FOL: Atomic Sentences Atomic Sentences state facts (logical truth values). An atomic sentence is a Predicate symbol, optionally followed by a parenthesized list of any argument terms E.g., Married( Father(Richard), Mother(John) ) An atomic sentence asserts that some relationship (some predicate) holds among the objects that are its arguments. An Atomic Sentence is true in a given model if the An Atomic Sentence is true in a given model if the relation referred to by the predicate symbol holds among the objects (terms) referred to by the arguments.
15 Syntax of FOL: Connectives & Complex Sentences Complex Sentences are formed in the same way, and are formed using the same logical connectives, as we already know from propositional logic The Logical Connectives: biconditional implication and or negation Semantics for these logical connectives are the same as Semantics for these logical connectives are the same as we already know from propositional logic.
16 Syntax of FOL: Variables Variables range over objects in the world. A variable is like a term because it represents an object. A variable may be used wherever a term may be used. Variables may be arguments to functions and predicates. (A term with NO variables is called a ground term.) ( g ) (A variable not bound by a quantifier is called free.)
17 Syntax of FOL: Logical Quantifiers There are two Logical Quantifiers: Universal: x P(x) means For all x, P(x). The upside-down d A reminds you of ALL. Existential: x P(x) means There exists x such that, P(x). The upside-down E reminds you of EXISTS. Syntactic sugar --- we really only need one quantifier. x P(x) x P(x) x P(x) x P(x) You can ALWAYS convert one quantifier to the other. RULES: and RULE: To move negation in across a quantifier, change the quantifier to the other quantifier and negate the predicate on the other side. x P(x) x P(x) ) x P(x) x P(x)
18 Existential Quantification Existential quantification is equivalent to: Disjunction of all sentences obtained by substitution of an object for the quantified variable. Spot has a sister who is a cat. x Sister(x, Spot) Cat(x) Disjunction of all sentences obtained by substitution of an object for the quantified variable: Sister(Spot, Spot) Cat(Spot) Sister(Rick, Spot) Cat(Rick) Sister(LAX, Spot) Cat(LAX) Sister(Shayama, Spot) Cat(Shayama) Sister(France, Spot) Cat(France) Sister(Felix, Spot) Cat(Felix)
19 Combining Quantifiers --- Order (Scope) The order of unlike quantifiers is important. x y Loves(x,y) For everyone ( all x ) there is someone ( exists y ) whom they love y x Loves(x,y) - there is someone ( exists y ) whom everyone loves ( all x ) Clearer with parentheses: y ( x Loves(x,y) ) The order of like quantifiers does not matter. x y P(x, y) y x P(x, y) x y P(x, y) y x P(x, y)
20 De Morgan s Law for Quantifiers De Morgan s Rule P Q ( P Q ) P Q ( P Q) Generalized De Morgan s Rule xp x ( P ) xp x( P) ( P Q ) P Q xp x ( P ) ( P Q) P Q xp x( P) Rule is simple: if you bring a negation inside a disjunction or a conjunction, always switch between them (or and, and or).
21 FOL (or FOPC) Ontology: What kind of things exist in the world? What do we need to describe and reason about? Objects --- with their relations, functions, predicates, properties, and general rules. Reasoning Representation A Formal Symbol System Inference Formal Pattern Matching Syntax Semantics Schema Execution What is said What it means Rules of Inference Search Strategy This lecture Next lecture
22 Semantics: Worlds The world consists of objects that have properties. There are relations and functions between these objects Objects in the world, individuals: people, houses, numbers, colors, baseball games, wars, centuries Clock A, John, 7, the-house in the corner, Tel-Aviv Functions on individuals: father-of, best friend, third inning of, one more than Relations: brother-of, bigger than, inside, part-of, has color, occurred after Properties (a relation of arity 1): red, round, bogus, prime, multistoried, beautiful
23 Semantics: Interpretation An interpretation of a sentence (wff) is an assignment that maps Object constant symbols to objects in the world, n-ary function symbols to n-ary functions in the world, n-ary relation symbols to n-ary relations in the world Given an interpretation, an atomic sentence has the value true if it denotes a relation that holds for those individuals denoted in the terms. Otherwise it has the value false. Example: Kinship world: Symbols = Ann, Bill, Sue, Married, Parent, Child, Sibling, World consists of individuals in relations: Married(Ann,Bill) is false, Parent(Bill,Sue) is true,
24 Truth in first-order logic Sentences are true with respect to a model and an interpretation Model contains objects (domain elements) 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 p ( 1 n) iff the objects referred to by term 1,...,term n are in the relation referred to by predicate
25 Semantics: Models An interpretation satisfies a wff (sentence) if the wff has the value true under the interpretation. Model: A domain and an interpretation that satisfies a wff is a model of that wff Validity: Any wff that t has the value true under all interpretations is valid Any wff that does not have a model is inconsistent or unsatisfiable If a wff w has a value true under all the models of a set of sentences KB then KB logically entails w
26 Models for FOL: Example
27
28
29
30
31
32 Using FOL We want to TELL things to the KB, e.g. xkingx, ( ) Personx ( ) TELL(KB, ) TELL(KB, King(John) ) These sentences are assertions We also want to ASK things to the KB, x, Person ( x ) ASK(KB, ) these are queries or goals The KB should return the list of x s for which Person(x) is true: {x/john,x/richard,...}
33 FOL Version of Wumpus World Typical percept sentence: Percept([Stench,Breeze,Glitter,None,None],5) Actions: Turn(Right), Turn(Left), Forward, Shoot, Grab, Release, Climb To determine best action, construct query: a BestAction(a,5) ASK solves this and returns {a/grab} And TELL about the action.
34 Knowledge Base for Wumpus World Perception s,b,g,x,y,t Percept([s,Breeze,g,x,y],t) Breeze(t) s,b,x,y,t b x y t Percept([s,b,Glitter,x,y],t) t) Glitter(t) Reflex action t Glitter(t) BestAction(Grab,t) t) Reflex action with internal state t Glitter(t) Holding(Gold,t) H BestAction(Grab,t) ti t) Holding(Gold,t) can not be observed: keep track of change.
35 Deducing hidden properties Environment definition: x,y,a,b Adjacent([x,y],[a,b]) [a,b] {[x+1,y], [x-1 1,y],[x,y+1],[x,y y][xy+1][xy-1]} 1]} Properties of locations: s,t At(Agent,s,t) Breeze(t) Breezy(s) Squares are breezy near a pit: Diagnosticrule---infer cause from effect s Breezy(s) r Adjacent(r,s) Pit(r) Causal rule---infer effect from cause (model based reasoning) r Pit(r) [ s Adjacent(r,s) Breezy(s)]
36
37
38
39 Set Theory in First-Order Logic Can we define set theory using FOL? - individual sets, union, intersection, etc Answer is yes. Basics: - empty set = constant = { } - unary predicate Set( ), true for sets - binary predicates: x s (true if x is a member of the set x) s 1 s 2 (true if s1 is a subset of s2) - binary functions: intersection s 1 s 2, union s 1 s 2, adjoining {x s}
40 A Possible Set of FOL Axioms for Set Theory The only sets are the empty set and sets made by adjoining an element to a set s Set(s) (s = {} ) ( x,s 2 Set(s 2 ) s = {x s 2 }) The empty set has no elements adjoined to it x,s {x s} = {} Adjoining an element already in the set has no effect x,s x s s = {x s} The only elements of a set are those that were adjoined into it. Expressed recursively: x,s x s [ y,s 2 (s = {y s 2 } (x = y x s 2 ))]
41 A Possible Set of FOL Axioms for Set Theory A set is a subset of another set iff all the first set s members are members of the 2 nd set s 1,s 2 s 1 s 2 ( x x s 1 x s 2 ) 1, ( 1 2) Two sets are equal iff each is a subset of the other s 1,s 2 (s 1 = s 2 ) (s 1 s 2 s 2 s 1 ) An object is in the intersection of 2 sets only if a member of both x,s 1,s 2 x (s 1 s 2 ) (x s 1 x s 2 ) An object is in the union of 2 sets only if a member of either x,s 1,s 2 x (s 1 s 2 ) (x s 1 x s 2 )
42 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
43 The electronic circuits domain One-bit full adder Possible queries: - does the circuit function properly? -what gates are connected to the first input terminal? - what would happen if one of the gates is broken? and so on
44 The electronic circuits domain 1. Identify the task Does the circuit actually add properly? 2. Assemble the relevant knowledge Composed of wires and gates; Types of gates (AND, OR, XOR, NOT) Irrelevant: size, shape, color, cost of gates 3. Decide on a vocabulary Alternatives: Type(X ) = XOR (function) Type(X 1 ) = XOR (function) Type(X 1, XOR) (binary predicate) XOR(X 1 ) (unary predicate)
45 The electronic circuits domain 4. 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)) g)) = 0 n Signal(In(n,g)) g)) = 0 g Type(g) = XOR Signal(Out(1,g)) = 1 Signal(In(1,g)) Signal(In(2,g)) g)) g Type(g) = NOT Signal(Out(1,g)) Signal(In(1,g))
46 The electronic circuits domain 5. Encode the specific problem instance Type(X 1 ) = XOR Type(X 2 ) = XOR Type(A 1 ) = AND Type(A 2 ) = AND Type(O 1 ) = OR Connected(Out(1,X 1 ),In(1,X 2 )) Connected(In(1,C 1 ),In(1,X 1 )) Connected(Out(1,X 1 )In(2A ),In(2,A 2 )) Connected(In(1,CC 1 )In(1A ),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 t(1 O 1 )O ),Out(2,C t(2c)) 1 Connected(In(3,C (3 C 1 )I ),In(1,A (1A)) 2
47 The electronic circuits domain 6. Pose queries to the inference procedure What are the possible sets of values of all the terminals for the adder circuit? cu 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 7. Debug the knowledge base May have omitted assertions like 1 0
48 Syntactic Ambiguity FOPC provides many ways to represent the same thing. E.g., Ball-5 is red. HasColor(Ball-5, Red) Ball-5 and Red are objects related by HasColor. Red(Ball-5) Red is a unary ypredicate applied to the Ball-5 object. HasProperty(Ball-5, Color, Red) Ball-5, Color, and Red are objects related by HasProperty. ColorOf(Ball-5) = Red Ball-5 and Red are objects, and ColorOf() is a function. HasColor(Ball-5(), Red()) Ball-5() and Red() are functions of zero arguments that both return an object, which objects are related by HasColor. This can GREATLY confuse a pattern-matching reasoner. Especially if multiple people collaborate to build the KB, and they all have different representational conventions.
49 Summary First-order logic: Much more expressive than propositional logic Allows objects and relations as semantic primitives Universal and existential quantifiers syntax: constants, functions, predicates, equality, quantifiers Knowledge engineering using FOL Capturing domain knowledge in logical form Inference and reasoning in FOL Next lecture Required Reading: All of Chapter 8 Next lecture: Chapter 9
Knowledge 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 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 informationFirst-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 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 (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 informationFirst-Order Logic Chap8 1. Pros and Cons of Prop. Logic
Chapter8 First-Order Logic 20070503 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
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 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 (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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 (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 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 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 informationCS-171 Final Review. At least one question from a prior quiz or old CS-171 test will appear on the Final Exam (and all other tests)
CS-171 Final Review First-Order Logic, Knowledge Representation (8.1-8.5, 9.1-9.2) Probability & Bayesian Networks (13, 14.1-14.5) Machine Learning (18.1-18.12, 20.1-20.2) Questions on any topic Pre-mid-term
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 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 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 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 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 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 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 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 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 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 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 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 information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
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 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 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 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 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 informationLogic. proof and truth syntacs and semantics. Peter Antal
Logic proof and truth syntacs and semantics Peter Antal antal@mit.bme.hu 10/9/2015 1 Knowledge-based agents Wumpus world Logic in general Syntacs transformational grammars Semantics Truth, meaning, models
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. 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 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 informationAgenda. Artificial Intelligence. Reasoning in the Wumpus World. The Wumpus World
Agenda Artificial Intelligence 10. Propositional Reasoning, Part I: Principles How to Think About What is True or False 1 Introduction Álvaro Torralba Wolfgang Wahlster 2 Propositional Logic 3 Resolution
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 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 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 & Logic Agents Chapter 7 (& background)
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Logic & Logic Agents Chapter 7 (& background)
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. 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 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 informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
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 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 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 informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
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 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 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 informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 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 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 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 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 informationProseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1
First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 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 information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
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 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 informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificial Intelligence Spring 2007 Lecture 8: Logical Agents - I 2/8/2007 Srini Narayanan ICSI and UC Berkeley Many slides over the course adapted from Dan Klein, Stuart Russell or Andrew Moore
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 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 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 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 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 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 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 information