SAT Based BDD Solver for Quantified Boolean Formulas.
Gilles AudemardLakhdar SaisPublished in: ICTAI (2004)
Keyphrases
- quantified boolean formulas
- boolean formula
- sat solvers
- propositional satisfiability
- orders of magnitude
- answer set programming
- sat instances
- constraint satisfaction
- reasoning tasks
- search space
- sat encodings
- sat problem
- search tree
- search strategies
- binary decision diagrams
- max sat
- constraint solver
- planning problems
- decision procedures
- answer sets
- np complete
- practical problems
- search strategy