Sciweavers

ECCC
2000
77views more  ECCC 2000»
13 years 11 months ago
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the ...
Herbert Fleischner, Stefan Szeider
LMCS
2006
126views more  LMCS 2006»
13 years 11 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
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 tha...
Jean H. Gallier
JAR
2008
81views more  JAR 2008»
13 years 11 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah