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: â€“ e.g. p, â€“ A special clause: The empty clause, shown as â–¡ , : or {} â€¢ A formula is said to be in Conjunctive Normal Form (CNF) if it is the conjunction of some number of clauses York University CSE 3401 3 r q p 02CNF & Horn CNF (example) York University CSE 3401 4 ) ( ) ( ) ( t r r s q q p Ë„ Ë… p q Ë… q Â¬s r Ë… Â¬r t 02CNF & Horn CNF Facts â€¢ For every formula of propositional logic, there exists a formula A in CNF such that A is a tautology â€¢ A polynomial algorithm exists for converting to A â€¢ For practical purposes, we use CNFs in Logic Programming York University CSE 3401 5 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