Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.
Florian LonsingUwe EglyAllen Van GelderPublished in: SAT (2013)
Keyphrases
- quantified boolean formulas
- propositional satisfiability
- clause learning
- sat solvers
- unit propagation
- davis putnam
- propositional logic
- boolean formula
- constraint programming
- reasoning tasks
- industrial applications
- decision procedures
- max sat
- search space
- automated reasoning
- conjunctive normal form
- constraint satisfaction
- orders of magnitude