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 DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: • To prove G, we need to show is inconsistent York University CSE 3401 5 } { G P q; t : p. , p: s. Parent clauses q; t : s. Resolvent Resolving upon p, being on different sides of : Complementary literals 04_Resolution Example (1) • Program P={q:. , p:q.} • Query :p. – This is already the negated form of our goal! York University CSE 3401 6 q:. p: q. :p. :q. : empty clause, inconsistency therefore p is satisfiable true 04_Resolution Refutation • When resolution is used to prove inconsistency, it is also called refutation. (refute=disprove) • The above binary tree, showing resolution and resulting in the empty clause, is called a refutation tree. • NOTE: To avoid potential mistakes, DO NOT RESOLVE UPON MORE THAN ONE LITERAL SIMULTANEOUSLY. York University CSE 3401 7 04_Resolution...
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
 Computer Science, C Programming

Click to edit the document details