A satisfiability procedure for quantified Boolean formulae.
David A. PlaistedArmin BiereYunshan ZhuPublished in: Discret. Appl. Math. (2003)
Keyphrases
- quantified boolean formulae
- davis putnam
- propositional logic
- satisfiability problem
- sat problem
- symmetry breaking
- quantified boolean formulas
- propositional satisfiability
- phase transition
- cnf formula
- first order logic
- constraint satisfaction
- belief revision
- np complete
- tree search
- constraint programming
- constraint satisfaction problems
- natural language processing
- sat instances
- desirable properties
- search algorithm
- temporal logic
- integrity constraints
- heuristic search