Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution.
Olaf BeyersdorffBenjamin BöhmPublished in: Electron. Colloquium Comput. Complex. (2020)
Keyphrases
- quantified boolean formulas
- sat solvers
- clause learning
- propositional satisfiability
- boolean formula
- unit propagation
- conjunctive normal form
- sat solving
- boolean satisfiability
- max sat
- orders of magnitude
- constraint satisfaction
- sat instances
- sat problem
- search strategies
- davis putnam
- sat encodings
- satisfiability problem
- search tree
- decision procedures
- automated reasoning
- reasoning tasks
- industrial applications
- propositional logic
- search algorithm
- constraint programming
- search space
- symmetry breaking
- evolutionary algorithm