On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets.
Oliver KullmannXishun ZhaoPublished in: SAT (2012)
Keyphrases
- cnf formula
- davis putnam
- propositional formulas
- np complete
- sat solvers
- clause learning
- boolean formula
- propositional logic
- sat problem
- propositional satisfiability
- max sat
- phase transition
- satisfiability problem
- knowledge compilation
- unit propagation
- conjunctive normal form
- constraint satisfaction
- constraint satisfaction problems
- random sat
- search space
- horn clauses
- convex sets