PAI Recitation 3 – Logic Yuxin Chen 12-10-2012. Inference Truth tables Modus ponens Resolution …

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Inference in First-Order Logic
Artificial Intelligence 8. The Resolution Method
Inference Rules Universal Instantiation Existential Generalization
Standard Logical Equivalences
Resolution.
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.
Logic Use mathematical deduction to derive new knowledge.
Propositional Logic CMSC 471 Chapter , 7.7 and Chuck Dyer
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.
Resolution in Propositional and First-Order Logic.
Predicate Calculus Russell and Norvig: Chapter 8,9.
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 Theorem Prover in First-Order Logic
Knowledge Representation I Suppose I tell you the following... The Duck-Bill Platypus and the Echidna are the only two mammals that lay eggs. Only birds.
Outline Recap Knowledge Representation I Textbook: Chapters 6, 7, 9 and 10.
Logic in general Logics are formal languages for representing information such that conclusions can be drawn Syntax defines the sentences in the language.
Logic. Propositional Logic Logic as a Knowledge Representation Language A Logic is a formal language, with precisely defined syntax and semantics, which.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2004.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Lecture 9 Jim Martin.
3 Logic Translate the following four English sentences to first order logic (FOL). [4p] 1. Anyone passing his history exams and winning the lottery is.
Knoweldge Representation & Reasoning
Inference in First-Order Logic
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Fall 2004.
Predicate Calculus.
03 -1 Lecture 03 First-Order Predicate Logic Topics –Syntax –Formal Semantics –Denotational Semantics –Formal Inference –Resolution.
Inference in FOL Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 9 Spring 2005.
Start with atomic sentences in the KB and apply Modus Ponens, adding new atomic sentences, until “done”.
Propositional Logic Agenda: Other forms of inference in propositional logic Basics of First Order Logic (FOL) Vision Final Homework now posted on web site.
Predicates and Quantifiers
Propositional Logic Reasoning correctly computationally Chapter 7 or 8.
INFERENCE IN FIRST-ORDER LOGIC IES 503 ARTIFICIAL INTELLIGENCE İPEK SÜĞÜT.
The Foundations: Logic and Proofs
Inference in First-Order logic Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
For Wednesday Read chapter 10 Prolog Handout 4. Exam 1 Monday Take home due at the exam.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 19, 2012.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Logical Agents Logic Propositional Logic Summary
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
1 CMSC 471 Fall 2002 Class #10/12–Wednesday, October 2 / Wednesday, October 9.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 11 of 41 Wednesday, 15.
For Monday Read “lectures” 6,9-12 of Learn Prolog Now: saarland.de/~kris/learn-prolog-now/ saarland.de/~kris/learn-prolog-now/
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
CSE LOGIC1 Propositional Logic An “adventure game” example Thinking?
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 12 Friday, 17 September.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 15 of 41 Friday 24 September.
Artificial Intelligence First-Order Logic (FOL). Outline of this Chapter The need for FOL? What is a FOL? Syntax and semantics of FOL Using FOL.
CS-554 Part-3: First-Order Logic
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
REVIEW : Quantifiers A key to predicate logic we have been ignoring is the inclusion of quantifiers You should recall from discrete that you can also write.
Propositional & Predicate Calculus _I
11 Artificial Intelligence CS 165A Tuesday, October 30, 2007  Knowledge and reasoning (Ch 7) Propositional logic  First-order logic (Ch 8) 1.
For Wednesday Finish reading chapter 10 – can skip chapter 8 No written homework.
Computing & Information Sciences Kansas State University Wednesday, 19 Sep 2007CIS 530 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 19 September.
Reasoning with Propositional Logic automated processing of a simple knowledge base CD.
First-Order Logic Reading: C. 8 and C. 9 Pente specifications handed back at end of class.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Propositional Logic Session 3
Tutorial – First Order (Predicate) Logic
For Monday Read chapter 10, sections 1-3 Prolog handout 4
First Order Logic: Logical Inference
PROPOSITIONAL LOGIC - SYNTAX-
Predicates and Quantifiers
Presentation transcript:

PAI Recitation 3 – Logic Yuxin Chen

Inference Truth tables Modus ponens Resolution …

Resolution Transform KB into CNF

Resolution: Example H: Heads up T: Tails up IW: I win UL : You lose Heads, I win Tails, you lose Either heads or tails I win or you lose I don’t win H => IW T => UL H ¬T IW UL ¬IW

Resolution Why can’t we just use resolution to derive the sentence we are interested in (instead of adding its negation and derive false)? Use resolution to derive from KB?

Resolution Why can’t we just use modus ponens instead of resolution to derive the sentence we are interested in? Modus ponens Example: P implies Q; Not P implies Q. Show that Q is ture.

Resolution Resolution is sound and complete Recall:

First order logic A superset of propositional logic Don’t treat propositions as “atomic” entities. Sentences refer to objects, their relationships, and their properties. TypesExample Objects Bob, October 12 Relations/predicatesMotherOf, ColorOf FunctionsIsMotherOf, IsBlue Connectives ∧∨ ¬ ⇔ ⇒ Quantifiers Universal: ∀ x:(isMan(x)) ⇒ isMortal(x)) Existential: ∃ y: ( isFather (y, Fred) )

Example: Convert to First-Order Logic ∀ x isSibling (x, Bob) ⇒ isKind(x) ∀ x isSibling (x, Bob) ∧ isKind(x) ∃ x At(x, ETH) ⇒ isSmart(x) ∃ x At(x, ETH) ∧ isSmart(x)

Example: Convert to English There is only one correct answer (do not use ∃ !) First cousin (child of your parent’s siblings) All grad students watch the same TV shows Any person can fool some of the people all of the time, all of the people some of the time but not all of the people all of the time

Example: Convert to English and FOL

Example (Cont..) In the sentences below, a symbol is missing. What symbol is it most likely to be? – ∀ x Something(x) ??? SomethingElse(x) – ∃ x Something(x) ??? SomethingElse(x)

Example (Cont..) Is this correctly written? – Peter has at least two children. – ∃ x,y ParentOf(Peter, x) ∧ ParentOf(Peter, y)

Resolution in FOL: Example Jack owns a dog. Every dog owner is an animal lover, and no animal lover kills an animal. Either Jack or Curiosity killed the cat, who is named Tuna. Did Curiosity kill the cat?

Resolution in ROL: Conjunctive Normal Form Jack owns a dog. Every dog owner is an animal lover. No animal lover kills an animal. Either Jack or Curiosity killed the cat, who is named Tuna. Did Curiosity kill the cat?

Resolution in ROL

Summary