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

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

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full DocumentRight Arrow Icon
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
Background image of page 2
Horn Clause A Horn clause is a clause with at most one positive
Background image of page 3

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

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

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 Right Arrow Icon
Ask a homework question - tutors are online