This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: York University CSE 3401 18 02CNF & 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 02CNF & 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 02CNF & 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.
 Fall '11
 Movahedi
 C Programming

Click to edit the document details