On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Oliver KullmannXishun ZhaoPublished in: CoRR (2012)
Keyphrases
- cnf formula
- davis putnam
- np complete
- propositional formulas
- boolean formula
- max sat
- sat problem
- phase transition
- sat solvers
- satisfiability problem
- propositional logic
- clause learning
- knowledge compilation
- conjunctive normal form
- propositional satisfiability
- horn clauses
- random sat
- search algorithm
- constraint satisfaction
- industrial applications
- randomly generated
- theorem prover
- search strategies
- normal form
- simulated annealing
- np hard
- knowledge base