1 / 38

Cooperating Intelligent Systems

Cooperating Intelligent Systems. First-order predicate logic Chapter 8, AIMA. Why first order logic (FOL)?. Logic is a language we use to express knowledge. Propositional (boolean) logic is too limited; complex environments cannot be described in a concise way.

Renfred
Download Presentation

Cooperating Intelligent Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Cooperating Intelligent Systems First-order predicate logic Chapter 8, AIMA

  2. Why first order logic (FOL)? • Logic is a language we use to express knowledge. • Propositional (boolean) logic is too limited; complex environments cannot be described in a concise way. • First order logic (predicate calculus) can express common-sense knowledge.

  3. 4 3 2 1 2 3 4 1 Limitations of propositional logic B C

  4. 4 3 2 1 2 3 4 1 B C We would like something like

  5. First-order logic (FOL) Builds on: • Objects:Man, woman, house, car, conflict,... • Relations (between objects): Unary properties (red, green, nice,...)N-ary relations (larger, below,...) • Functions:Father of, brother of, beginning of

  6. First-order logic (FOL)Syntax Components ConstantsA, 125, Q, John, KingJohn, TheCrown, EiffelTower, Wumpus, HH, Agent,... Function constants (of all ”arities”)FatherOf1, DistanceBetween2, Times2, LeftLegOf1, NeighborOf1, King1,... Relations (predicates, of all ”arities”)Parent2, Brother2, Married2, Before2, Ontop2, Orange1,... Connectives and separators∨ ∧ ¬ ⇒ ( ) , The superscript denotes the ”arity” = the number of arguments

  7. First-order logic (FOL)Syntax Components ConstantsA, 125, Q, John, KingJohn, TheCrown, EiffelTower, Wumpus, HH, Agent,... Function constants (of all ”arities”)FatherOf1, DistanceBetween2, Times2, LeftLegOf1, NeighborOf1, KingOf1,... FatherOf(John) DistanceBetween(Timisoara,Lugoj) Times(6,8)LeftLegOf(KingJohn)NeighborOf(Square31)KingOf(England)

  8. B C First-order logic (FOL)Syntax Components ConstantsA, 125, Q, John, KingJohn, TheCrown, EiffelTower, Wumpus, HH, Agent,... Relations (predicates, of all ”arities”)Parent2, Brother2, Married2, Before2, Ontop2, Orange1,... Parent(Bill,John) Brother(RichardTheLionheart,KingJohn) Married(CarlXVIGustaf,Silvia)Before(A,B)OnTop(Block(B),Block(C))Orange(Block(C))

  9. Unary Binary R = RichardTheLionheart J = KingJohn C = Crown Object constants Function constants LeftLegOf(R) LeftLegOf(J) Relations (predicates) Person(R) Person(J) King(J) Crown(C) Brother(J,R) Brother(R,J) OnHead(C,J)

  10. First-order logic (FOL)Syntax Terms • An object constant is a term • A complete function constant is a term (complete = all arguments given) • A variable is a term(more on this later...)

  11. First-order logic (FOL)Syntax Sentences Atomic sentenceA complete predicate symbol (relation)Brother(RichardTheLionheart,KingJohn), Dead(Mozart), Married(CarlXVIGustaf,Silvia), Orange(Block(C)),... Complex sentenceFormed by sentences and connectivesDead(Mozart) ∧ Composer(Mozart), ¬King(RichardTheLionheart) ⇒ King(KingJohn),King(CarlXVIGustaf) ∧ Married(CarlXVIGustaf,Silvia) ⇒ Queen(Silvia) Semantics: The truth value of complex sentences is determined with truth tables

  12. A B C Example: Block world

  13. First-order logic (FOL)Syntax Variables and quantifiers Variables refer to unspecified objects in the domain. They are denoted by lower case letters (at the end of the alphabet)x, y, z, ... Quantifiers constrain the meaning of a variable in a sentence. There are two quantifiers: ”For all” (∀) and ”There exists” (∃) Existential quantifier Universal quantifier

  14. First-order logic (FOL)Syntax Variables and quantifiers (∀ ”For all...”)

  15. Slide from S. Russel @ Berkeley

  16. First-order logic (FOL)Syntax Variables and quantifiers (∃ ”There exists...”)

  17. First-order logic (FOL)Syntax Variables and quantifiers (∃ ”There exists...”)

  18. Slide from S. Russel @ Berkeley

  19. First-order logic (FOL)Syntax Nested quantifiers

  20. First-order logic (FOL)Syntax Nested quantifiers The order of ∀ and ∃ matters!

  21. Quantifier duality DeMorgan’s rules Ponder these for a while...

  22. Family fun Family axioms: ”A mother is a female parent” ”A husband is a male spouse” ”You’re either male or female” ”A child’s parent is the parent of the child” (sic!) ”My grandparents are the parents of my parents” ”Siblings are two children who share the same parents” ”A first cousin is a child of the siblings of my parents” ...etc. Family theorems: Sibling is reflexive © 1998, Jon A. Davis Write these in FOL

  23. Family fun Family axioms: ∀m,c (m = Mother(c)) ⇔ (Female(m) ∧ Parent(m,c)) ∀w,h Husband(h,w) ⇔ Male(h) ∧ Spouse(h,w) ∀x Male(x) ⇔¬Female(x) ∀p,c Parent(p,c) ⇔Child(c,p) ∀g,c Grandparent(g,c) ⇔∃p (Parent(g,p) ∧ Parent(p,c)) ∀x,y Sibling(x,y) ⇔ (∃p (Parent(p,x) ∧ Parent(p,y))) ∧ (x ≠ y) ∀x,y FirstCousin(x,y) ⇔∃p,s (Parent(p,x) ∧ Sibling(p,s) ∧ Parent(s,y)) ...etc. Family theorems: ∀x,y Sibling(x,y) ⇔ Sibling(y,x) ...etc. © 1998, Jon A. Davis Spouse(Gomez,Morticia)Parent(Morticia,Wednesday)Sibling(Pugsley,Wednesday)Sister(Ophelia,Morticia)FirstCousin(Gomez,Itt) ∃p (Parent(p,Morticia) ∧ Sibling(p,Fester))

  24. Matematical fun • ”The square of every negative integer is positive” • ∀x [Integer(x) ∧ (x > 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x < 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x ≤ 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x < 0)∧ (x2 > 0)] • ”Not every integer is positive” • ∀x [¬Integer(x) ⇒(x > 0)] • ∀x [Integer(x) ⇒(x ≤ 0)] • ∀x [Integer(x) ⇒¬(x > 0)] • ¬∀x [Integer(x) ⇒(x > 0)] Borrowed from http://people.hofstra.edu/faculty/Stefan_Waner/RealWorld/logic/logic7.html

  25. Matematical fun • ”The square of every negative integer is positive” • ∀x [Integer(x) ∧ (x > 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x < 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x ≤ 0)⇒ (x2 > 0)] • ∀x [Integer(x) ∧ (x < 0)∧ (x2 > 0)] • ”Not every integer is positive” • ∀x [¬Integer(x) ⇒(x > 0)] • ∀x [Integer(x) ⇒(x ≤ 0)] • ∀x [Integer(x) ⇒¬(x > 0)] • ¬∀x [Integer(x) ⇒(x > 0)] Borrowed from http://people.hofstra.edu/faculty/Stefan_Waner/RealWorld/logic/logic7.html

  26. 4 3 2 1 2 3 4 1 The Wumpus world revisited Object constants: Square s = [x,y], Agent, Time (t), Percept p = [p1,p2,p3,p4,p5], Gold Predicates: Pit(s), Breezy(s), EvilSmelling(s), Wumpus(s), Safe(s), Breeze(p,t), Stench(p,t), Glitter(p,t), Wall(p,t), Scream(p,t), Adjacent(s,r), At(Agent,s,t), Hold(Gold,t) cf. the 275 rules in boolean KB (There are other possible representations)

  27. Puzzles with nested quantifiers • Are both these statements true? TRUE FALSE

  28. Puzzles with nested quantifiers • Are both these statements true? TRUE FALSE

  29. Translations... Translate the following sentences to a first order logic expression • The product of two negative integers is positive • The difference of two negative integers is not necessarily negative Examples borrowed from Aaron Blomfield @ University of Virginia & Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

  30. Translations... Translate the following sentences to a first order logic expression • The product of two negative integers is positive • The difference of two negative integers is not necessarily negative Examples borrowed from Aaron Blomfield @ University of Virginia & Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

  31. Translations... Translate the following sentences to a first order logic expression • The product of two negative integers is positive • The difference of two negative integers is not necessarily negative Examples borrowed from Aaron Blomfield @ University of Virginia & Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

  32. Translations... Translate the following sentences to a first order logic expression • The product of two negative integers is positive • The difference of two negative integers is not necessarily negative Why not ∧ ? Why not ⇒ ? Examples borrowed from Aaron Blomfield @ University of Virginia & Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

  33. Translations... Translate the following sentences to a first order logic expression • The product of two negative integers is positive • The difference of two negative integers is not necessarily negative Can we write yx ? Why not ∧ ? Why not ⇒ ? Can we write yx ? Examples borrowed from Aaron Blomfield @ University of Virginia & Kenneth Rosen, Discrete Math and Its Applications, 5th edition. McGraw Hill, 2003

  34. Translations... Translate the following sentences to a first order logic expression • There is a student at HH who has taken every mathematics course offered at HH. • Every salesman has at least one apple

  35. Translations... Translate the following sentences to a first order logic expression • There is a student at HH who has taken every mathematics course offered at HH. • Every salesman has at least one apple

  36. Translations... Translate the following sentences to a first order logic expression • There is a student at HH who has taken every mathematics course offered at HH. • Every salesman has at least one apple

  37. Translations... Translate the following sentences to a first order logic expression • There is a student at HH who has taken every mathematics course offered at HH. • Every salesman has at least one apple

  38. Translations... Translate the following sentences to a first order logic expression • There is a student at HH who has taken every mathematics course offered at HH. • Every salesman has at least one apple

More Related