Computer Science – Logic in Computer Science
Scientific paper
2006-06-19
LMCS 2 (5:3) 2006
Computer Science
Logic in Computer Science
7 pages, submitted to LMCS
Scientific paper
10.2168/LMCS-2(5:3)2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a resolution refutation. As a consequence, none of these proofs actually gives an algorithm for producing a resolution refutation from an unsatisfiable set of clauses. In this note, we give a simple and constructive proof of the completeness of propositional resolution which consists of an algorithm together with a proof of its correctness.
No associations
LandOfFree
The Completeness of Propositional Resolution: A Simple and Constructive<br> Proof does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Completeness of Propositional Resolution: A Simple and Constructive<br> Proof, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Completeness of Propositional Resolution: A Simple and Constructive<br> Proof will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-304548