CNF_Horn 4 - York University- CSE 3401 18 02-CNF...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Example P: { p:-q. , q:-.} If we want to know about p, we will ask the query: :-p. Note that the set { p:-q., q:-., :-p.} is inconsistent. (Reminder: truth table for above clauses does not have even one row where all the clauses are true) Therefore p is provable and your theorem proving program (e.g. Prolog) will return true . York University- CSE 3401 16 02-CNF & Horn
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
‘Predicate Logic’ Clauses Same definition for literals, clauses, and CNF except now each literal is more complicated since an atomic formula is more complicated in predicate logic We need to deal with quantifiers and their object variables when converting to CNF York University- CSE 3401 17 02-CNF & Horn
Background image of page 2
Conversion to CNF in Predicate Logic 1. Remove implication and equivalence 2. Move negations inwards 3. Rename variables so that variables of each quantifier are unique 4. Move all quantifiers to the front (conversion to Prenex Normal Form or PNF) 5. Skolemize (get rid of existential quantifiers) 6. Distribute OR over AND 7. Remove all universal quantifiers
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: York University- CSE 3401 18 02-CNF & Horn Example Example: Convert the following formula to CNF: Step 1. Remove implication and equivalence Step 2. Move negations inwards Note Step 3. Rename variables so that variables of each quantifier are unique Step 4. Move all quantifiers to the front (PNF) York University- CSE 3401 19 ) ( ) ( ) ( ) ( x p x x p x ) ( ) , ( ) )( ( ) ( ) , ( ) ( ) ( ) ( ) , ( ) ( ) ( ) ( ) , ( ) ( ) ( X n Y X m Y X X n Y X m Y X X n Y X m Y X X n Y X m Y X 02-CNF & Horn Example- cont. Step 5. Skolemizing (get rid of existential quantifiers) Step 6. Distribute OR over AND to have conjunctions of disjunctions as the body of the formula Step 7. Remove all universal quantifiers Logic Programming notation: York University- CSE 3401 20 ). , ( : ) ( ) ( ) , ( ) ( ) , ( ) )( ( Y X m X n X n Y X m X n Y X m Y X 02-CNF & Horn...
View Full Document

This note was uploaded on 02/14/2012 for the course CSE 3401 taught by Professor Movahedi during the Fall '11 term at York University.

Page1 / 5

CNF_Horn 4 - York University- CSE 3401 18 02-CNF...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online