Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Lecture 15 of 42 William H. Hsu Department.

Slides:



Advertisements
Similar presentations
Artificial Intelligence 8. The Resolution Method
Advertisements

Inference Rules Universal Instantiation Existential Generalization
Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
We have seen that we can use Generalized Modus Ponens (GMP) combined with search to see if a fact is entailed from a Knowledge Base. Unfortunately, there.
For Friday No reading Homework: –Chapter 9, exercise 4 (This is VERY short – do it while you’re running your tests) Make sure you keep variables and constants.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.
Propositional Logic Russell and Norvig: Chapter 6 Chapter 7, Sections 7.1—7.4 Slides adapted from: robotics.stanford.edu/~latombe/cs121/2003/home.htm.
Logic.
Computing & Information Sciences Kansas State University Lecture 16 of 42 CIS 530 / 730 Artificial Intelligence Lecture 16 of 42 Knowledge Engineering.
Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus Artificial Intelligence Chapter 14. Resolution in the Propositional Calculus.
Computing & Information Sciences Kansas State University Lecture 20 of 42 CIS 530 / 730 Artificial Intelligence Lecture 20 of 42 Introduction to Classical.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.
Computing & Information Sciences Kansas State University Lecture 11 of 42 CIS 530 / 730 Artificial Intelligence Lecture 11 of 42 William H. Hsu Department.
Knoweldge Representation & Reasoning
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Fall 2004.
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2005.
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
UIUC CS 497: Section EA Lecture #3 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Conjunctive normal form: any formula of the predicate calculus can be transformed into a conjunctive normal form. Def. A formula is said to be in conjunctive.
Logical Inference 2 rule based reasoning
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 16 Monday, 29 September.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Computing & Information Sciences Kansas State University Lecture 19 of 42 CIS 530 / 730 Artificial Intelligence Lecture 19 of 42 Knowledge Representation.
Computing & Information Sciences Kansas State University Friday, 29 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 16 of 42 Friday, 29 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 11 of 41 Wednesday, 15.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 13 of 41 Monday, 20 September.
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
LECTURE LECTURE Propositional Logic Syntax 1 Source: MIT OpenCourseWare.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 12 Friday, 17 September.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Computing & Information Sciences Kansas State University Monday, 25 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 14 of 42 Monday, 25 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 23 Friday, 17 October.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 41 Wednesday, 22.
CPSC 386 Artificial Intelligence Ellen Walker Hiram College
CS6133 Software Specification and Verification
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 18 of 41 Friday, 01 October.
Computing & Information Sciences Kansas State University Wednesday, 19 Sep 2007CIS 530 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 19 September.
Computing & Information Sciences Kansas State University Monday, 23 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 25 of 42 Monday, 23 October.
Computing & Information Sciences Kansas State University Friday, 20 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 24 of 42 Friday, 20 October.
Knowledge Repn. & Reasoning Lec. #5: First-Order Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part B Propositional Logic.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
Computing & Information Sciences Kansas State University Wednesday, 13 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 10 of 42 Wednesday, 13 September.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Computing & Information Sciences Kansas State University CIS 530 / 730: Artificial Intelligence Lecture 09 of 42 Wednesday, 17 September 2008 William H.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 14 of 42 Wednesday, 22.
Proof Methods for Propositional Logic CIS 391 – Intro to Artificial Intelligence.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Computing & Information Sciences Kansas State University Monday, 22 Sep 2008CIS 530 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 22 September.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Computing & Information Sciences Kansas State University Friday, 03 Oct 2008CIS 530 / 730: Artificial Intelligence Lecture 16 of 42 Friday, 03 October.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EA C461 Artificial Intelligence
Knowledge Representation and Reasoning
Resolution in the Propositional Calculus
Logical Inference: Through Proof to Truth
Biointelligence Lab School of Computer Sci. & Eng.
Biointelligence Lab School of Computer Sci. & Eng.
Presentation transcript:

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Lecture 15 of 42 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: Course web site: Instructor home page: Reading for Next Class: Chapter 9, p , Russell & Norvig 2 nd edition Definition of Type-0 Grammar: Russell’s Paradox: Logic programming: FOL: Resolution Strategies and Computability Discussion: Decidability and Logic

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Lecture Outline Reading for Next Class: Review Chapter 9 (p. 272 – 319), R&N 2 e Last Class: Forward/Backward Chaining, (p ), R&N 2 e  Unification (previewed in Lecture 13)  GMP implemented: forward chaining / Rete algorithm, backward chaining  Conversion to clausal form (CNF): procedure, example  Prolog: SLD resolution  Preview: refutation theorem proving using resolution, proof example Today: Resolution Theorem Proving, Section 9.5 (p ), R&N 2 e  Proof example in detail  Paramodulation and demodulation  Resolution strategies: unit, linear, input, set of support  FOL and computability: complements and duals  Semidecidability (  RE \ REC) of validity, unsatisfiability  Undecidability of (  RE) of non-validity, satisfiability  Theoretical foundations and ramifications of decidability results Next Class: Logic Programming (Prolog), Knowledge Engineering

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Apply Sequent Rules to Generate New Assertions Modus Ponens And Introduction Universal Elimination FOL Sequent Rules and Example: Review Adapted from slides © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Forward Chaining in FOL – Algorithm: Review Based on © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence © 2004 S. Russell & P. Norvig. Reused with permission. Backward Chaining in FOL – Algorithm: Review

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Backward Chaining in FOL – Example Proof: Review © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Clausal Form Mnemonic – INSEUDOR: Review Implications Out (Replace with Disjunctive Clauses) Negations Inward (DeMorgan’s Theorem) Standardize Variables Apart (Eliminate Duplicate Names) Existentials Out (Skolemize) Universals Made Implicit Distribute And Over Or (i.e., Disjunctions Inward) Operators Made Implicit (Convert to List of Lists of Literals) Rename Variables (Independent Clauses) A Memonic for Star Trek: The Next Generation Fans Captain Picard: I’ll Notify Spock’s Eminent Underground Dissidents On Romulus I’ll Notify Sarek’s Eminent Underground Descendant On Romulus Adapted from: Nilsson and Genesereth (1987). Logical Foundations of Artificial Intelligence.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Skolemization: Eliminating Existential Quantifiers Based on slide © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Clausal Form (CNF) Conversion [1]: Review Based on slide © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Clausal Form (CNF) Conversion [2]: Review Based on slide © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Resolution: Review © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Refutation-Based Resolution Theorem Proving Based on slide © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Based on slide © 2004 S. Russell & P. Norvig. Reused with permission. Resolution Proof Example [1]

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Based on slide © 2004 S. Russell & P. Norvig. Reused with permission. Resolution Proof Example [2]

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Problem: How To Find Inference Rules for Sentences With =  Unification OK without it, but…  A = B doesn’t force P(A) and P(B) to unify Solutions  Demodulation  Generate substitution from equality term  Additional sequent rule, Section 9.5 (p. 304) R&N 2 e  Paramodulation  More powerful: e.g., (x = y)  P(x)  Generate substitution from WFF containing equality constraint  Sequent rule sketch, Section 9.5 (p. 304) R&N 2 e  Full discussion in Nilsson & Genesereth Dealing with Equality in FOL: Demodulation & Paramodulation © 2003 S. Russell & P. Norvig

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Unit Preference  Idea: Prefer inferences that produce shorter sentences  Compare: Occam’s Razor  How? Prefer unit clause (single-literal) resolvents (α  β with  β  α)  Reason: trying to produce a short sentence (   True  False) Input Resolution  Idea: “diagonal” proof (proof “list” instead of proof tree)  Every resolution combines some input sentence with some other sentence  Input sentence: in original KB or query Resolution Strategies [1]: Unit and Input Resolution Unit resolution Input resolutions

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Linear Resolution  Generalization of input resolution  Include any ancestor in proof tree to be used Set of Support (SoS)  Idea: try to eliminate some potential resolutions  Prevention as opposed to cure  How?  Maintain set SoS of resolution results  Always take one resolvent from it  Caveat: need right choice for SoS to ensure completeness Resolution Strategies [2]: Linear Resolution and Set-of-Support Linear resolutions

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Subsumption  Idea: eliminate sentences that sentences that are more specific than others  e.g., P(x) subsumes P(A) Putting It All Together Resolution Strategies [3]: Subsumption

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence L FOL-VALID (written L VALID ): Language of Valid Sentences (Tautologies) Deciding Membership  Given: KB, α  Decide: KB ⊨ α? (Is α valid? Is ¬α contradictory, i.e., unsatisfiable?) Procedure  Test whether KB  {¬α} ⊢ RESOLUTION   Answer YES if it does L FOL-SAT C (written L SAT C ) Language of Unsatisfiable Sentences Dual Problems Semi-Decidable: L VALID, L SAT C  RE \ REC (“Find A Contradiction”)  Recursive enumerable but not recursive  Can return in finite steps and answer YES if α  L VALID or α  L SAT C  Can’t return in finite steps and answer NO otherwise Decision Problem [1]: FOL Validity / Unsatisfiability

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence L FOL-VALID C (written L VALID C ): Language of Non-Valid Sentences Deciding Membership  Given: KB, α  Decide: KB ⊭ α? (Is there a counterexample to α? i.e., is ¬α satisfiable?) Procedure  Test whether KB  {α} ⊢ RESOLUTION   Answer YES if it does NOT L FOL-SAT (written L SAT ) Language of Satisfiable Sentences Dual Problems Undecidable: L VALID C, L SAT  RE (“Find A Counterexample”)  Not recursive enumerable  Can return in finite steps and answer NO if α  L VALID C or α  L SAT  Can’t return in finite steps and answer YES otherwise Decision Problem [2]: FOL Non-Validity / satisfiability

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Universe of Decision Problems Recursive Enumerable Languages (RE) Recursive Languages (REC) Hilbert’s Entscheidungsproblem and Other Decision Problems Co-RE (RE C ) L H : Halting problem L D : Diagonal problem

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Logic Programming: Review © 2004 S. Russell & P. Norvig. Reused with permission.

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Terminology Resolution: Sound and Complete Inference Rule/Procedure for FOL  Antecedent (aka precedent): sentences “above line” in sequent rule  Resolvent (aka consequent): sentences “below line” in sequent rule Generalized Modus Ponens (GMP): Sequent Rule  Forward chaining (FC) implementation: Rete algorithm  Backward chaining (BC) implementation  Fan-out (new facts) vs. fan-in (preconditions) Clausal Form aka Conjunctive Normal Form (CNF)  Canonical (standard) form for theorem proving by resolution, FC, BC  INSEUDOR procedure Decision Problems: True-False for Membership in Formal Language  Recursive: decidable  Recursive enumerable: decidable or semi-decidable  Semi-decidable: can answer YES when true but not necessarily NO  Undecidable: can’t necessarily answer YES when true  Hilbert’s 10 th problem (Entscheidungsproblem): mathematical truth

Computing & Information Sciences Kansas State University Lecture 15 of 42 CIS 530 / 730 Artificial Intelligence Summary Points Last Class: GMP, Unification, Forward and Backward Chaining  Generalized Modus Ponens (GMP)  Sound, complete rule for first-order inference (reasoning in FOL)  Requires pattern matching by unification  Unification: matches well-formed formulas (WFFs), atoms, terms Resolution: Sound and Complete Inference Rule/Procedure for FOL  Proof example in detail  Paramodulation and demodulation  Resolution strategies: unit, linear, input, set of support  FOL and computability: complements and duals  Semidecidability (  RE \ REC) of validity, unsatisfiability  Undecidability of (  RE) of non-validity, satisfiability  Decision problems  Relation to computability, formal languages (Type-0 Chomsky language) Read About: Russell’s Paradox Next: Prolog (Briefly); Knowledge Engineering, Ontology Intro