The Hebrew University of Jerusalem

Slides:



Advertisements
Similar presentations
Artificial Intelligence First-Order Logic
Advertisements

Artificial Intelligence 8. The Resolution Method
Some Prolog Prolog is a logic programming language
Resolution Proof System for First Order Logic
First-Order Logic.
Biointelligence Lab School of Computer Sci. & Eng.
Inference Rules Universal Instantiation Existential Generalization
The Logic of Quantified Statements
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 06 : First Order Logic Resolution Prove.
Standard Logical Equivalences
First-Order Logic (FOL) aka. predicate calculus. First-Order Logic (FOL) Syntax User defines these primitives: – Constant symbols (i.e., the "individuals"
Resolution.
Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
First Order Logic Resolution
Inference and Reasoning. Basic Idea Given a set of statements, does a new statement logically follow from this. For example If an animal has wings and.
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.
Resolution Theorem Proving
Predicate Calculus Russell and Norvig: Chapter 8,9.
1 Resolution in First Order Logic CS 171/271 (Chapter 9, continued) Some text and images in these slides were drawn from Russel & Norvig’s published material.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
1 Applied Computer Science II Resolution in FOL Luc De Raedt.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Constraint Logic Programming Ryan Kinworthy. Overview Introduction Logic Programming LP as a constraint programming language Constraint Logic Programming.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.
1 Automated Reasoning Introduction to Weak Methods in Theorem Proving 13.1The General Problem Solver and Difference Tables 13.2Resolution Theorem.
Inference and Resolution for Problem Solving
CSE (c) S. Tanimoto, 2007 Unification 1 Unification Predicate calculus rules are sometimes so general that we need to create specializations of.
Formal Aspects of Computer Science – Week 12 RECAP Lee McCluskey, room 2/07
Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus Artificial Intelligence Chapter 14 Resolution in the Propositional Calculus.
CSC411Artificial intelligence 1 Chapter 2 The Predicate Calculus Contents The Propositional Calculus The Predicate Calculus Using Inference Rules to Produce.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Inference in First-Order logic Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
1 Chapter 8 Inference and Resolution for Problem Solving.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CSE S. Tanimoto Horn Clauses and Unification 1 Horn Clauses and Unification Propositional Logic Clauses Resolution Predicate Logic Horn Clauses.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Inference in FOL Compared to predicate logic, more abstract reasoning and specific conclusions.
Unification Algorithm Input: a finite set Σ of simple expressions Output: a mgu for Σ (if Σ is unifiable) 1. Set k = 0 and  0 = . 2. If Σ  k is a singleton,
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.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
Computing & Information Sciences Kansas State University Monday, 25 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 14 of 42 Monday, 25 September.
CPSC 386 Artificial Intelligence Ellen Walker Hiram College
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.
Reasoning using First-Order Logic
The Law of Resolution Formal Aspects of Computer Science - Week 7 The Law of Resolution Lee McCluskey, room 2/07
第 1 6 章 谓词演算中的归结. 2 Outline Unification Predicate-Calculus Resolution Completeness and Soundness Converting Arbitrary wffs to Clause Form Using Resolution.
Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil Johri CS 440 / ECE 448 Introduction to Artificial Intelligence.
CSE (c) S. Tanimoto, 2008 Predicate Calculus II 1 Predicate Calculus 2 Outline: Unification: definitions, algorithm Formal interpretations and satisfiability.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 05 : Knowledge Base & First Order Logic.
First-Order Logic Reading: C. 8 and C. 9 Pente specifications handed back at end of class.
CPSC 433 Artificial Intelligence Unification & Resolution Examples Andrew Kuipers Please include [CPSC433] in the subject line.
The function of knowledge representation scheme is
Horn Clauses and Unification
Biointelligence Lab School of Computer Sci. & Eng.
Horn Clauses and Unification
Horn Clauses and Unification
CSE (c) S. Tanimoto, 2004 Unification
CSE S. Tanimoto Unification
Horn Clauses and Unification
Biointelligence Lab School of Computer Sci. & Eng.
CSE (c) S. Tanimoto, 2002 Unification
Horn Clauses and Unification
RESOLUTION.
Resolution in predicate Logic
Resolution Preliminaries
Presentation transcript:

Introduction to Artificial Intelligence – Unit 5 Inference in first-order logic Course 67842 The Hebrew University of Jerusalem School of Engineering and Computer Science Academic Year: 2008/2009

Outline Substitution, Unification MGU Resolution

Examples of Computing MGU (1) Literal 1: Parents (x, Father(x), Mother (Bill)) Literal 2: Parents (Bill, Father(Bill), y) Step 1: s = x, t = Bill variables(s) = true, x is not a variable of t. We can write: theta = {[Bill/x]} Literal 1: Parents (Bill, Father(Bill), Mother (Bill)) And call Unify again.

Examples of Computing MGU (1) Step 2: s = Mother (Bill), t = y variables(t) = true, y is not a variable of s. We can write: theta = {[Bill/x], [Mother (Bill)/y]} Literal 1: Parents (Bill, Father(x), Mother (Bill)) Literal 2: Parents (Bill, Father(Bill), Mother (Bill)) And we are done.

Examples of Computing MGU (2) Literal 1: g(x,f(x)) Literal 2: g(f(y),y) Step 1: s = x, t = f(y) variables(s) = true, x is not a variable of t. We can write: theta = {[f(y)/x]} Literal 1: g(f(y),f(f(y)) And call Unify again.

Examples of Computing MGU (2) Step 2: s = f(f(y)), t = y s and t share a variable (y) and thus we cannot substitute them. We got failure !

Using Resolution to Prove a Statement

Using Resolution to Prove a Statement

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Converting a Sentence to CNF

Skolemization Example

Skolemization Example Original meaning allows each person to fail to love a different animal or to be loved by a different person. This is also the meaning of (2). The meaning of (1) is that everyone either fails to love a particular animal A or is loved by some particular animal B.

Resolution Example

Resolution Example

Resolution Example

Resolution Example