using first order logic ch 9 announcements
play

Using first order logic (Ch. 9) Announcements Writing 4 posted HW - PowerPoint PPT Presentation

Oct 23, 2023 •269 likes •738 views

Using first order logic (Ch. 9) Announcements Writing 4 posted HW 3 graded Unification First sentence is the only one with variables, there are 9 options (only 6 if x y) One unification is {x/Sue, y/Devin} We cannot say {x/Devin,

  1. Using first order logic (Ch. 9)

  2. Announcements Writing 4 posted HW 3 graded

  3. Unification First sentence is the only one with variables, there are 9 options (only 6 if x ≠ y) One unification is {x/Sue, y/Devin} We cannot say {x/Devin, y/Alex}, as this is creates a contradiction

  4. General modus ponens Objects = {Cat, Dog, Frog, Rat, Sally, Jane} Is Sally happy? How about Party(Sally, Frog)?

  5. General modus ponens We can substitute {x/Sally} here with MP: To get: Then sub. {x/Sally, y/Frog} with MP here: To get: However, we cannot tell if Sally is happy, as we cannot unify:

  6. Review: unification & MP Today we will focus on using modus ponens with unification to infer whether a statement is true or not To use general modus ponens, we need to find a substitution for the variables that is valid Finding this substitution is more or less a brute force method (try to substitute the most restricted variables first)

  7. General modus ponens You try! Can you get Grilled(Bread)? How about Grilled(Chicken)?

  8. General modus ponens You try! Can you get Grilled(Bread)? Yes How about Grilled(Chicken)? No

  9. Forward chaining You probably just reasoned out the way to think through this, but we will talk about two algorithms to do this in a procedural manner The first we will look at is forward chaining, where you build up new sentences using modus ponens until you generate your goal Then we will talk about improvements over this basic implementation

  10. Forward chaining Consider the following KB...

  11. Forward chaining Grilled(Bread) Sandwich(Bread) Grilled(M1) 1. 2. 3. 4. 5. 6.

  12. Forward chaining Algorithm: 1. repeat until new empty 2. new ←{} 3. for each sentence in KB 4. for each substantiation for a modus ponens 5. q ← substitute RHS of modus ponens 6. if q does not unify/match sentence in KB 7. new ←new U q 8. if q satisfies query, return q 9. add new to KB 10. return false

  13. Forward chaining Build the whole forward chaining KB for:

  14. Forward chaining F(B1) C(B1) ^ D(B1) 1. 2. 3. 4. 5. 6.

  15. Forward chaining This basic approach is redundant and can be improved in three major ways: 1. Improve the efficiency of unification -Allows for faster modus ponens 2. Incremental forward chaining -Reduces redundant computations 3. Eliminate irrelevant facts -Prunes KB

  16. Unification efficiency It is efficient to unify/substitute for the variable with the least possibilities on the left hand side (LHS) of modus ponens This is basically the same arguments are the “minimum remaining value” for CSPs The look-up of values for a single variable is constant time, but then we need to compare against all other in sentence (NP-hard problem)

  17. Unification efficiency In the example, we only have B(B1) true for some variable B1, which is probably smaller than all possible A(x) So here it would make sense to substitute B1 first into the first sentence, then try to find a matching A value (which is easy as A(x) is valid for any x)

  18. Incremental chaining All novel sentences build off the “new” set (except for building the first level) The computer re-searches all the old sentences every time and regenerates the same sentences By requiring the “new” set to be involved, we can greatly cut down computation of the depth of chain tree is fairly deep

  19. Incremental chaining In the example, the first loop of chaining finds: When starting the second loop, all possible combinations of the original KB will be searched again, and generate the above again Instead, we can limit our search to just combined with any of the original KB sentences

  20. Eliminate irrelevancy There are two primary ways reduce search: 1. Start from the goal and work backwards 2. Restrict KB to help guide search The first way works backwards keeping track of any possible useful sentences Any sentences not found on the reverse search (BFS, DFS or anything) can be dropped

  21. Eliminate irrelevancy For example, in our KB: If we wanted to check: KB entails “E(Sally)” Sentence 2. gets the goal and needs C Sentence 1. gives C (and D) and needs A & B Sentence 5. and 6. give A&B... can drop 3&4

  22. Eliminate irrelevancy You can add more restrictions to existing sentences to focus the search early on This combined with the unification efficiency can greatly speed up search For example, if we asked entailment: , we could modify the first sentence: and add Elim(Cat) to cause conflict early

  23. Forward chaining Forward chaining is sound (will not create invalid sentences) If all the sentences in the KB are definite then it is complete (can find all entailed sentences) Definite means that there can only be one positive literal in CNF form

  24. Backward chaining Backward chaining is almost the opposite of forward chaining (like eliminating irrelevancy) You try all sentences that are of the form: , and try to find a way to satisfy P1, P2, ... recursively This is similar to a depth first search AND/OR trees (OR are possible substitutions while AND nodes are the sentence conjunctions)

  25. Backward chaining Let's go back to this and backward chain Grilled(Bread)

  26. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(x) Make(Bread,x,Bread) 4. 6.

  27. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(x) Make(Bread,x,Bread) 4. 6. These variables have no correlation, so relabel one to be different

  28. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(z) Make(Bread,z,Bread) 4. 6. Begin DFS (left branch first)

  29. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(z) Make(Bread,z,Bread) 4. 6. Begin DFS (left branch first)

  30. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(z) Make(Bread,z,Bread) 4. 6. Begin DFS (left branch first)

  31. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(z) Make(Bread,z,Bread) 4. 6. Begin DFS (left branch first)

  32. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(z) Make(Bread,z,Bread) 4. 6. {z/M1} Begin DFS (left branch first)

  33. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} applies to all sentences Begin DFS (left branch first)

  34. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} Begin DFS (left branch first)

  35. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} Begin DFS (left branch first)

  36. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} {} Begin DFS (left branch first)

  37. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} {} Begin DFS (left branch first)

  38. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} {} Begin DFS (left branch first)

  39. Backward chaining Grilled(Bread) 3. 2. Sandwich(Bread) OnGrill(x,Bread) 5. 1. {x/any x} Meat(M1) Make(Bread,M1,Bread) 4. 6. {z/M1} {} Begin DFS (left branch first)

  40. Backward chaining The algorithm to compute this needs to mix between going deeper into the tree (ANDs) and unifying/substituting (ORs) For this reason, the search is actually two different mini-algorithms that intermingle: 1. FOL-BC-OR (unify) 2. FOL-BC-AND (depth)

  41. Backward chaining FOL-BC-OR(KB, goal, sub) 1. for each rule (lhs => rhs) with rhs == goal 2. standardize-variables(lhs, rhs) 3. for each newSub in FOL-BC-AND(KB, lhs, unify(rhs, goal sub)) 4. yield newSub FOL-BC-AND(KB, goals sub) 1. if sub = failure, return 2. else if length(goals) == 0 then yield sub 3. else 4. first,rest ←First(goals), Rest(goals) 5. for each newSub in FOL-BC-OR(KB, substitute(sub, first), sub) 6. for each newNewSub in FOL-BC-AND(KB, rest, newSub) 7. yield newNewSub

  42. Backward chaining Use backward chaining to infer: Grilled(Chicken)

  43. Backward chaining Grilled(Chicken) 3. 2. Meat(Chicken) OnGrill(x,Chicken) OnGrill(x,Chicken) 4. 5. 5. {Chicken/M1} Sandwich(Chicken) Fail! Begin DFS (left branch first)

  44. Backward chaining Grilled(Chicken) 3. 2. Meat(Chicken) OnGrill(x,Chicken) OnGrill(x,Chicken) 4. 5. 5. {Chicken/M1} Sandwich(Chicken) Fail! No such sentence Fail! Begin DFS (left branch first)

  45. Backward chaining Similar to normal DFS, this backward chaining can get stuck in infinite loops (in the case of functions) However, in general it can be much faster as it can be fairly easily parallelized (the different branches of the tree)

Recommend

First order logic (Ch. 8) Announcements Test next Tuesday! Midterm 2... covers hw 3&4:

First order logic (Ch. 8) Announcements Test next Tuesday! Midterm 2... covers hw 3&4:

First order logic (Ch. 8) Announcements Test next Tuesday! Midterm 2... covers hw 3&4: -Heuristics -Local search -Minimax/Alpha-Beta -Game theory -CSP (constraint satisfaction) Review: Propositional logic Propositional logic builds

484 views • 30 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic Valentin Goranko Stockholm University October 2016 Goranko Translation from first-order logic to natural language: examples in the structure of real

994 views • 20 slides
First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic (like natural language) assumes the world contains First-order logic Objects: people, houses, numbers, theories, Ronald McDonald, colors, baseball

245 views • 6 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

382 views • 24 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

451 views • 26 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak

188 views • 14 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak Goranko

1.69k views • 109 slides
Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Extending SMT solvers to higher-order logic Haniel Barbosa Andrew Reynolds Daniel El Ouraoui Clark Barrett Cesare Tinelli SMT 2019 20190707, Lisbon, PT To be published in the proceedings of CADE 2019 Why higher-order logic?

569 views • 25 slides
First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in relational database queries. This requires to drop functions except for constants. In particuar we assume to have a countably infinite set of constants

542 views • 5 slides
ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic

ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic

ARTIFICIAL INTELLIGENCE Russell & Norvig Chapter 8. First-Order Logic First-Order Logic First-Order Predicate Logic / Calculus Much more powerful the propositional (Boolean) logic Greater expressive power than propositional

590 views • 20 slides
First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic

First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic

First-order logic 6 AI Slides (5e) c Lin Zuoquan@PKU 2003-2019 6 1 6 First-Order Logic 6.1 First-order logic Syntax Semantics 6.2 Knowledge representation in FOL 6.3 Agents in first-order case AI Slides (5e) c Lin

814 views • 45 slides
Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic

Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic

Putting the Pieces Together Markov Logic Markov Logic Probability First-Order Logic Propositional Logic Markov Logic Definition A Markov Logic Network (MLN) is a set of A logical KB is a set of hard constraints pairs (F, w) where on

350 views • 6 slides
Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order

Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order

Logic-based Program Verification Decidability of Propositional and First-Order Logic. First-Order Theories. Theory of Equality M ad alina Era scu Tudor Jebelean Research Institute for Symbolic Computation, Johannes Kepler University,

1.3k views • 92 slides
Outline First-order logic Syntax and semantics Inference First-order Logic

Outline First-order logic Syntax and semantics Inference First-order Logic

Outline First-order logic Syntax and semantics Inference First-order Logic Propositionalization with ground inference Lifted resolution CS 486/686 Sept 25, 2008 University of Waterloo 1 2 CS486/686 Lecture Slides (c)

81 views • 6 slides
First order logic (FOL) Proposi)onal logic is about simple

First order logic (FOL) Proposi)onal logic is about simple

Introduc)on to Ar)ficial Intelligence Lecture 9 Logical reasoning CS/CNS/EE 154 Andreas Krause TexPoint fonts used in EMF. First order logic

528 views • 22 slides
using First-Order Logic C H A P T E R 8 H A S S A N K H O S R A V I S P R I N G 2 0 1 1

using First-Order Logic C H A P T E R 8 H A S S A N K H O S R A V I S P R I N G 2 0 1 1

Knowledge Representation using First-Order Logic C H A P T E R 8 H A S S A N K H O S R A V I S P R I N G 2 0 1 1 Outline What is First-Order Logic (FOL)? Syntax and semantics Using FOL Wumpus world in FOL Knowledge

739 views • 34 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.3 Basic grammar and use of

Logic as a Tool Chapter 3: Understanding First-order Logic 3.3 Basic grammar and use of

Logic as a Tool Chapter 3: Understanding First-order Logic 3.3 Basic grammar and use of first-order languages Valentin Goranko Stockholm University October 2016 Goranko Translation from natural languages to first-order logic: examples in the

221 views • 19 slides
Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.5 Resolution for

Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.5 Resolution for

Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.5 Resolution for First-order Logic Valentin Goranko Stockholm University October 2016 Goranko First-order resolution The Propositional Resolution rule in clausal form

617 views • 26 slides
Part 1: Propositional Logic Literature (also for first-order logic) Sch oning: Logik f ur

Part 1: Propositional Logic Literature (also for first-order logic) Sch oning: Logik f ur

Part 1: Propositional Logic Literature (also for first-order logic) Sch oning: Logik f ur Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax Language propositional

540 views • 23 slides
Logics for Data and Knowledge Representation 1. Introduction to First order logic Luciano

Logics for Data and Knowledge Representation 1. Introduction to First order logic Luciano

Why First Order Logic? Syntax and Semantics of FOL Reasoning in FOL Logics for Data and Knowledge Representation 1. Introduction to First order logic Luciano Serafini FBK-irst, Trento, Italy September 24, 2012 1 / 120 Why First Order Logic?

1.25k views • 120 slides
Part 2: First-Order Logic First-order logic formalizes fundamental mathematical concepts

Part 2: First-Order Logic First-order logic formalizes fundamental mathematical concepts

Part 2: First-Order Logic First-order logic formalizes fundamental mathematical concepts is expressive (Turing-complete) is not too expressive (e. g. not axiomatizable: natural numbers, uncountable sets) has a rich structure of

808 views • 23 slides
Introduction to first-order logic: First-order structures and languages. Terms and formulae in

Introduction to first-order logic: First-order structures and languages. Terms and formulae in

Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September 2010 V Goranko Propositional

329 views • 32 slides
What is a Logic Program Introduction to Logic Programming Foundations, First-Order Language

What is a Logic Program Introduction to Logic Programming Foundations, First-Order Language

What is a Logic Program Introduction to Logic Programming Foundations, First-Order Language Logic program is a set of certain formulas of a first-order language. Temur Kutsia In this lecture: syntax and semantics of a first-order

332 views • 7 slides
Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.2 Semantic Tableaux for

Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.2 Semantic Tableaux for

Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.2 Semantic Tableaux for First-Order Logic Valentin Goranko Stockholm University December 2020 Goranko First-order Semantic Tableau: introduction The system of semantic

542 views • 19 slides

More recommend