Conversion to Conjunctive Normal Form. Assertion All Romans who know Marcus either hate Caesar or think than anyone who hates anyone is crazy. All Romans.

Slides:



Advertisements
Similar presentations
Resolution Proof System for First Order Logic
Advertisements

Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
Standard Logical Equivalences
Resolution.
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
Artificial Intelligence
First Order Logic 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.
Resolution
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
F22H1 Logic and Proof Week 7 Clausal Form and Resolution.
Resolution Proof Example Prateek Tandon, John Dickerson.
Using Predicate Logic Chapter 5.
Formal Logic Proof Methods Direct Proof / Natural Deduction Conditional Proof (Implication Introduction) Reductio ad Absurdum Resolution Refutation.
Discrete Structures Chapter 1 Part B Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.
Inference and Resolution for Problem Solving
Search in the semantic domain. Some definitions atomic formula: smallest formula possible (no sub- formulas) literal: atomic formula or negation of an.
1 Predicates and quantifiers Chapter 8 Formal Specification using Z.
Last time Proof-system search ( ` ) Interpretation search ( ² ) Quantifiers Equality Decision procedures Induction Cross-cutting aspectsMain search strategy.
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
Lecture 22 More NPC problems
Conjunctive normal form: any formula of the predicate calculus can be transformed into a conjunctive normal form. Def. A formula is said to be in conjunctive.
1 Chapter 8 Inference and Resolution for Problem Solving.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Prolog IV Logic.
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.
1CS3754 Class Notes 14B, John Shieh, Figure 2.5: Further steps in the unification of (parents X (father X) (mother bill)) and (parents bill.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
1.3 Solving Systems by Substitution. Steps for Substitution 1.Solve for the “easiest” variable 2.Substitute this expression into the other equation 3.Solve.
Scope, free variable, closed wff §In  X(A) or  X(A), where A is a wff : X is called the variable quantified over; A is said to be (within) the scope.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Extra slides for Chapter 3: Propositional Calculus & Normal Forms Based on Prof. Lila Kari’s slides For CS2209A, 2009 By Dr. Charles Ling;
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Prolog Conversion to clause form Reference: Artificial Intelligence, by Elaine Rich and Kevin Knight.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
第 1 6 章 谓词演算中的归结. 2 Outline Unification Predicate-Calculus Resolution Completeness and Soundness Converting Arbitrary wffs to Clause Form Using Resolution.
For Wednesday Finish reading chapter 10 – can skip chapter 8 No written homework.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Converting arbitrary wffs to CNF A wff is in prenex form iff it consists of a string of quantifiers (called a prefix) followed by a quantifier free formula.
Chapter 3 Propositional calculus Predicate calculus Artificial Intelligence Dr.Hassan Al-Tarawneh.
Chapter 1 Logic and proofs
Introduction to Logic for Artificial Intelligence Lecture 2
CSE15 Discrete Mathematics 01/23/17
Predicate Logic Lecture 7.
Horn Clauses and Unification
3-2: Solving Systems of Equations using Substitution
Knowledge & Reasoning Logical Reasoning: to have a computer automatically perform deduction or prove theorems Knowledge Representations: modern ways of.
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
Horn Clauses and Unification
Horn Clauses and Unification
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Predicates and Quantifiers
CSNB234 ARTIFICIAL INTELLIGENCE
RESOLUTION.
1.3 Propositional Equivalences
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
3-2: Solving Systems of Equations using Substitution
Presentation transcript:

Conversion to Conjunctive Normal Form

Assertion All Romans who know Marcus either hate Caesar or think than anyone who hates anyone is crazy. All Romans wish they were Greeks.

Expressed in FOPL

For the transformation, let’s simplify Let P = roman(X) Q = know(X, marcus) R = hate(X, caesar) S = hate(Y,Z) T = thinkcrazy(X,Y) V = wish_greek(X)

Giving

Step 1: Eliminate implication using the identity So becomes

Applied to the Original Expression Now eliminate the second =>

Applied to the original expression

Eliminating the Third Implication Gives

Step 2: Invoke deMorgan

Step 3: Standardize the quantifiers so that each binds a unique variable For Example Given: We write:

Step 4: Move all quantifiers to the left without changing their order Step 3 makes this legal

Step 5: Eliminate Existential Quantifiers: Skolemization  Type 1 Given Tells us that there is an individual assignment to X drawn from its domain under which school(X) is satisfied..

  So, invent a function that goes into the domain of X and picks out just that item that satisfies school.   Call it pick   The original expression is transformed to: school(pick())   Where – –Pick is a function with no arguments – –That returns the value from the domain of X that satisfies School – –We might not know how to get the value. – –But we give a name to the method that we know exists

Type 2 Suppose we have Where P,Q are elements of the set of integers In English, given an integer P, there is another integer Q, such that Q > P We can’t invent a single function, because Q depends on P Instead, invent a function whose single argument is the universally quantified variable.

get(P) returns an integer > P Becomes

Our example has one instance of an existentially quantified variable within the scope of a universally quantified variable Becomes

Giving

Step 6: Drop the remaining quantifiers  Legal since everything is universally quantified

Step 7: Rewrite the expression as a conjunct of disjuncts using dist. And assoc. laws This Gives:

Step 8: Rewrite each conjunct as a separate clause that are implicitly anded

Step 9: Rename variables in clauses so that no two clauses use the same variable name This is already the case The Expression is now in conjunctive normal form.