Compressing BMC Encodings with QBF.
Toni JussilaArmin BierePublished in: Electron. Notes Theor. Comput. Sci. (2007)
Keyphrases
- quantified boolean formulas
- boolean satisfiability
- quantified boolean formulae
- propositional logic
- data compression
- boolean formula
- sat solving
- non binary
- sat encodings
- sat solvers
- sat problem
- knowledge base
- integer linear programming
- compressed data
- sat instances
- probabilistic planning
- graph coloring
- phase transition
- planning problems
- branch and bound algorithm
- np complete