On Davis-Putnam reductions for minimally unsatisfiable clause-sets.
Oliver KullmannXishun ZhaoPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- industrial applications
- davis putnam
- cnf formula
- propositional satisfiability
- propositional formulas
- np complete
- max sat
- clause learning
- unit propagation
- sat problem
- phase transition
- conjunctive normal form
- propositional logic
- boolean formula
- sat solvers
- knowledge compilation
- satisfiability problem
- search algorithm
- expert systems
- learning algorithm