Presentation is loading. Please wait.

Presentation is loading. Please wait.

Start with atomic sentences in the KB and apply Modus Ponens, adding new atomic sentences, until “done”.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Start with atomic sentences in the KB and apply Modus Ponens, adding new atomic sentences, until “done”."— Presentation transcript:

1

2

3 Start with atomic sentences in the KB and apply Modus Ponens, adding new atomic sentences, until “done”.

4

5

6

7

8 Work backward from the goal to find known facts that support the proof.

9

10

11 Conversion to CNF 1.Eliminate Implications 2.Move negation(s) inwards over qualifiers 3.Standarize apart variables (each qualifier should use a differn’t one 4.Skolemize – replace each existential variable with a skolem function 5.Drop universal quantifiers 6.Distribute  over 

12

13

14

15

16

17

18

19

20

21

22

23

Download ppt "Start with atomic sentences in the KB and apply Modus Ponens, adding new atomic sentences, until “done”."

Similar presentations

Inference in First-Order Logic

Inference in First-Order Logic
Artificial Intelligence 8. The Resolution Method

Artificial Intelligence 8. The Resolution Method
Some Prolog Prolog is a logic programming language

Some Prolog Prolog is a logic programming language
Resolution Proof System for First Order Logic

Resolution Proof System for First Order Logic
First-Order Logic.

First-Order Logic.
Inference Rules Universal Instantiation Existential Generalization

Inference Rules Universal Instantiation Existential Generalization
Standard Logical Equivalences

Standard Logical Equivalences
ITCS 3153 Artificial Intelligence Lecture 15 First-Order Logic Chapter 9 Lecture 15 First-Order Logic Chapter 9.

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 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.

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.

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.
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)

Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
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.

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.

13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.
Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Logic CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Logic.

Logic.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.

F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Resolution Proof Example Prateek Tandon, John Dickerson.

Resolution Proof Example Prateek Tandon, John Dickerson.
RESOLUTION: A COMPLETE INFERENCE PROCEDURE. I Then we certainly want to be able to conclude S(A); S(A) is true if S(A) or R(A) is true, and one of those.

RESOLUTION: A COMPLETE INFERENCE PROCEDURE. I Then we certainly want to be able to conclude S(A); S(A) is true if S(A) or R(A) is true, and one of those.
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.

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.

Similar presentations

Ads by Google