CNF_Horn 2

# CNF_Horn 2 - Conversion to CNF 1 Remove implication and...

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

Conversion to CNF 1. Remove implication and equivalence Use 2. Move negations inwards Use De Morgan’s 3. Distribute OR over AND York University- CSE 3401 6 ) ( ) ( ) ( ) ( ) ( ) ( ) ( p q q p p q q p q p q p q p ) ( ) ( ) ( ) ( q p q p q p q p ) ( ) ( ) ( r p q p r q p 02-CNF & Horn

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

View Full Document
Conversion to CNF- example Example: Convert the following formula to CNF York University- CSE 3401 7 ) ( ) ( ) ( ) ) ( ( )) ( ( ) ) (( )) ( ( ) ( p s r s p r p p s r s r p p s r s r p s r p 02-CNF & Horn
Representing a clause Consider this clause: In Logic programming, it is shown as: Easy way: positive literals on the left, negative literals on the right York University- CSE 3401 8 s r q p ) ( ) ( ) ( s q r p s q r p . , : ; ) ( ) ( r p s q r p s q 02-CNF & Horn

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

View Full Document
Logic Programming Notation
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 5

CNF_Horn 2 - Conversion to CNF 1 Remove implication and...

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

View Full Document
Ask a homework question - tutors are online