Artificial Intelligence

Slides:



Advertisements
Similar presentations
Inference in first-order logic
Advertisements

Inference in First-Order Logic
Some Prolog Prolog is a logic programming language
Inference in first-order logic
First-Order Logic.
Inference Rules Universal Instantiation Existential Generalization
ITCS 3153 Artificial Intelligence Lecture 15 First-Order Logic Chapter 9 Lecture 15 First-Order Logic Chapter 9.
Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
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.
Artificial Intelligence Inference in first-order logic Fall 2008 professor: Luigi Ceccaroni.
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.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Inference in FOL All rules of inference for propositional logic apply to first-order logic We just need to reduce FOL sentences to PL sentences by instantiating.
1 FOL CS 331/531 Dr M M Awais Unification “It is an algorithm for determining the substitutions needed to make two predicate calculus expressions match”
1 FOL Resolution based Inferencing Resolution based rules studied earlier can lead to inferences, rules such as modus ponen, unit resolution etc… Other.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9.
Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
Knoweldge Representation & Reasoning
Inference in First-Order Logic
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Fall 2004.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2005.
Inference in First-Order Logic Inference Rules with Quantifiers The three new inference rules are as follows: Universal Elimination: For any sentence ,
Cooperating Intelligent Systems Inference in first-order logic Chapter 9, AIMA.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
Inference in first-order logic I CIS 391 – Introduction to Artificial Intelligence AIMA Chapter (through p. 278) Chapter 9.5 (through p. 300)
Inference in first-order logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
CS 416 Artificial Intelligence Lecture 12 First-Order Logic Chapter 9 Lecture 12 First-Order Logic Chapter 9.
Logical Agents Logic Propositional Logic Summary
Computing & Information Sciences Kansas State University Lecture 13 of 42 CIS 530 / 730 Artificial Intelligence Lecture 13 of 42 William H. Hsu Department.
Computing & Information Sciences Kansas State University Lecture 14 of 42 CIS 530 / 730 Artificial Intelligence Lecture 14 of 42 William H. Hsu Department.
1 Inference in First-Order Logic CS 271: Fall 2009.
1 Inference in First Order Logic CS 171/271 (Chapter 9) Some text and images in these slides were drawn from Russel & Norvig’s published material.
An Introduction to Artificial Intelligence – CE Chapter 9 - Inference in first-order logic Ramin Halavati In which we define.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 11 Jim Martin.
Inference in first-order logic
Inference in First Order Logic. Outline Reducing first order inference to propositional inference Unification Generalized Modus Ponens Forward and backward.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Inference in First-Order Logic Chapter 9. Outline Reducing first-order inference to propositional inference Unification Generalized Modus Ponens Forward.
1 Chaining 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.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
EA C461 Artificial Intelligence
Announcements No office hours today!
Presented By S.Yamuna AP/CSE
Inference in first-order logic
Inference in First-Order Logic
EA C461 – Artificial Intelligence Logical Agent
Knowledge Representation & Reasoning
Inference in First-Order Logic
Inference in first-order logic part 1
Example of Knowledge Base
Artificial intelli-gence 1:Inference in first-order logic
Artificial intelligence: Inference in first-order logic
Artificial Intelligence Inference in First Order Logic
First Order Logic: Logical Inference
Inference in first-order logic
Artificial Intelligence
Inference in first-order logic part 1
فصل نهم استدلال در منطق مرتبه اول Session 5
CSE 4705 Artificial Intelligence
Artificial Intelligence
CS 416 Artificial Intelligence
Inference in First Order Logic (1)
Biointelligence Lab School of Computer Sci. & Eng.
Artificial Intelligence
Methods of Proof Chapter 7, second half.
First-Order Logic Inference
First-Order Logic Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

Artificial Intelligence Lecture 11 – Inference in First Order Logic Dr. Muhammad Adnan Hashmi 11 November 2018

Universal Instantiation Stands for substitution Typically a constant, which substitutes the variable Once the substitution is made, we can entail the new sentence 11 November 2018

Existential Instantiation It should not appear elsewhere in the data base, because of the existential quantifier (i.e., there exists….). So we assume the minimum value, i.e., there exists just one… 11 November 2018

Some Facts UI can be applied repeatedly to the same FOL sentence, in order to add new sentences The new KB always remains logically equivalent to the old one EI can be applied only once; and once it is applied, then the existentially quantified sentence should be removed from the KB The new KB is not logically equivalent to the old, but rather it is inferentially equivalent (You replace the existentially quantified sentence with an entailed one). 11 November 2018

Reduction to Propositional Inference For convenience, each one of these can be replaced by one symbol, e.g., A, B, C etc. 11 November 2018

Problems of Propositionalization 11 November 2018

Unification Unification is all about finding substitutions in order to make two expressions equal What substitution is required in order to make these two expressions equal? 11 November 2018

Unification 11 November 2018 8

Unification 11 November 2018 9

Unification 11 November 2018 10

Unification 11 November 2018 11

Generalized Modus Ponens i.e., with statements of this format Something important to remember 11 November 2018 12

Example Knowledge Base (EKB) The law says that it is a crime for an American to sell weapons to hostile nations. The country Nono, an enemy of America, has some missiles, and all of its missiles were sold to it by Colonel West, who is American. Prove that Col. West is a criminal 11 November 2018 13

EKB 11 November 2018 14

EKB 11 November 2018 15

Forward Chaining Algorithm 11 November 2018 16

Forward Chaining Proof All the basic facts that have been derived Start from the basic facts at the bottom. Then, you go through a series of iterations; each iteration is represented by trying to go one level upward from the current one. In each iteration, we write what we can infer (using unification on implication sentences only) from the bottom level. Basically, we can infer the consequent if the premise is satisfied with some substitution. 11 November 2018 17

Forward Chaining Proof First Iteration (unification and reasoning is possible only on the following three implications) Substitution: {x|M1} Substitution: {x|M1} Substitution: {x|Nono} 11 November 2018 18

Forward Chaining Proof Second Iteration: Only one implication is now possible on the following rule with substitution {x|West, y|M1, z|Nono} 11 November 2018 19

Backward Chaining Algorithm 11 November 2018 20

Backward Chaining Example Goal/query Work backward from the goal (query), chaining through implications in order to find facts that support the goal. The algorithm returns a set of substitutions that satisfy the goal It simply considers a goal, and finds every clause in the knowledge base whose positive literal (consequent) satisfies with this goal When this condition is satisfied, a new recursive call is generated in which the antecedent of the rule is added at the next (bottom) level 11 November 2018 21

Backward Chaining Example Criminal(West) can be unified with Criminal(x) with the substitution {x|West}: We first generate the literals in the antecedent 11 November 2018 22

Backward Chaining Example Criminal(West) can be unified with Criminal(x) with the substitution {x|West}: Then, we move depth-first through the literals, making the substitution {x|West} 11 November 2018 23

Backward Chaining Example Weapon(y) can be unified with the consequent Weapon(x): The difference in variables doesn’t matter; the concept is the same, i.e., x or y is a weapon So we generate its antecedent, i.e., Missile(y) 11 November 2018 24

Backward Chaining Example Missile(M1) unifies with Missile(y) with {y|M1} Now, generate antecedents for Sells, and assign {z|Nono} 11 November 2018 25

Backward Chaining Example With {z|Nono}, we get Hostile(Nono) Which unifies with Hostile(x) 11 November 2018 26

Properties of Backward Chaining 11 November 2018 27

Resolution: A Brief Summary 11 November 2018 28

Conversion to CNF 11 November 2018 29

Conversion to CNF 11 November 2018 30

Resolution Proof: Definite Clauses 11 November 2018 31

Resolution Proof In the previous slide, the squares marked in red are nothing but the consecutive goals in the backward chaining procedure. In fact, backward chaining is really just a special case of resolution, with a particular control strategy to decide which resolution to perform next. 11 November 2018 32

Questions 11 November 2018 33 33