First Order Logic: Logical Inference

Slides:

Advertisements

Similar presentations

Inference in first-order logic

Advertisements

Inference in First-Order Logic

Artificial Intelligence 8. The Resolution Method

Some Prolog Prolog is a logic programming language

Inference in first-order logic

First-Order Logic.

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.

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.

Logical Inference 1 introduction Chapter 9 Some material adopted from notes by Andreas Geyer-Schulz,, Chuck Dyer, and Mary Getoor.

13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution.

Methods of Proof Chapter 7, Part II. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound) generation.

Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.

Predicate Calculus Russell and Norvig: Chapter 8,9.

Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.

Proof methods Proof methods divide into (roughly) two kinds: –Application of inference rules Legitimate (sound) generation of new sentences from old Proof.

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.

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

Methods of Proof Chapter 7, second half.

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 IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.

Logical Agents Logic Propositional Logic Summary

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.

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

The AI War LISP and Prolog Basic Concepts of Logic Programming

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

Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.

Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 23 Friday, 17 October.

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.

Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 18 of 41 Friday, 01 October.

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.

Inference in First Order Logic. Outline Reducing first order inference to propositional inference Unification Generalized Modus Ponens Forward and backward.

Reasoning with Propositional Logic automated processing of a simple knowledge base CD.

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

1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.

1 Final Exam Review CS 171/ Coverage Problem Solving and Searching Chapters 3,4,6 Logic Chapters 7,8,9 LISP Only those sections covered in the slides.

Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.

Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.

EA C461 Artificial Intelligence

Inference in first-order logic

Inference in First-Order Logic

Logical Inference 1 introduction

Topics Covered since 1st midterm…

EA C461 – Artificial Intelligence Logical Agent

Logical Inference 4 wrap up

Logical Inference: Through Proof to Truth

Inference in First-Order Logic

Inference in first-order logic part 1

Artificial Intelligence

Logical Agents Chapter 7 Selected and slightly modified slides from

Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 20

Knowledge Representation and Inference

Artificial Intelligence

Inference in first-order logic part 1

فصل نهم استدلال در منطق مرتبه اول Session 5

CSE 4705 Artificial Intelligence

CS 416 Artificial Intelligence

Inference in First Order Logic (1)

EA C461 – Artificial Intelligence Logical Agent

Methods of Proof Chapter 7, second half.

SEG 4560 Midterm Review.

Logical Inference 4 wrap up

Presentation transcript:

First Order Logic: Logical Inference CHAPTER 12 First Order Logic: Logical Inference

Propositional Resolution

Propositional Resolution (cont)

Soundness and Completeness Soundness: if a sound procedure derives a sentence β from α, it must actually be entailed by α Completeness: if a sentence β is actually entailed by α, then it will eventually be derived from α by a complete procedure

Universal instantiation (UI)

Existential instantiation (EI)

Reduction to prop. inference

Problems with propositionalizati

Unification

Properties of forward chaining

Efficiency of forward chaining

Properties of backward chaining

Logic programming: Prolog

Resolution: brief summary

Conversion to CNF

Conversion to CNF contd.