CNF_Horn 3

# CNF_Horn 3 - Example summary Example Write the following...

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

Example- summary Example: Write the following formula in logic programming notation York University- CSE 3401 11 . , : . : . : : notation g programmin logic convert to ) ( ) ( ) ( : CNF convert to ) ( s r p p s p r p s r s p r p s r p 02-CNF & Horn

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

View Full Document
Another Example Write the following expression as Logic Programming Clauses: 1- Conversion to CNF: 2- Symmetry of ˄ allows for set notation of a CNF 3- Symmetry of ˅ allows for set notation of clauses 4- Logic Prog. notation York University- CSE 3401 12   ) ( ), ( ), ( t r q r s q p         , , , , , , t r r s q q p     ) ( ) ( t r q r s p     ) ( ) ( ) ( ) ( ) ( t r q r s q p t r q r s p . : . : ; . : ; r t s r q q p 02-CNF & Horn
Horn Clause A Horn clause is a clause with at most one positive

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

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

{[ snackBarMessage ]}

### Page1 / 5

CNF_Horn 3 - Example summary Example Write the following...

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

View Full Document
Ask a homework question - tutors are online