Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae.
Jussi RintanenPublished in: LPAR (2001)
Keyphrases
- davis putnam
- quantified boolean formulae
- propositional logic
- satisfiability problem
- propositional satisfiability
- sat problem
- tree search
- constraint satisfaction
- phase transition
- first order logic
- belief revision
- np complete
- cnf formula
- search algorithm
- temporal logic
- randomly generated
- sat solvers
- clause learning
- industrial applications
- symmetry breaking
- boolean formula
- branch and bound