8.module4 Resolution Using Propositional Logic 16
8.module4 Resolution Using Propositional Logic 16
8.module4 Resolution Using Propositional Logic 16
Propositional Logic
Proof with Resolution (Without Contradiction)
• r u == ( r u)
• u w == ( u w)
• r w == (r w)
• We then use resolution on the hypotheses to derive the conclusion ( w):
1. r u Premise
2. u w Premise
3. r w Premise
4. r w L1, L2, resolution
5. w w L3, L4, resolution
6. w L5, idempotence
7. END
Proofs by Contradiction using Resolution
• We can combine resolution with proof by contradiction (where we assert
the negation of what we wish to prove, and from that premise derive
FALSE) to direct our search towards smaller and smaller clauses, with the
goal of producing FALSE.
• Proof by contradiction:
( p 0) == p
1. r u Premise
2. u w Premise
3. r w Premise
4. w Negation of conclusion
7. w L6, idempotence