Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution.
Olaf BeyersdorffBenjamin BöhmPublished in: ITCS (2021)
Keyphrases
- quantified boolean formulas
- sat solvers
- clause learning
- boolean formula
- propositional satisfiability
- unit propagation
- orders of magnitude
- sat solving
- decision procedures
- davis putnam
- conjunctive normal form
- boolean satisfiability
- sat problem
- max sat
- reasoning tasks
- sat instances
- search strategies
- constraint satisfaction
- sat encodings
- search tree
- search space
- genetic algorithm
- theorem proving
- satisfiability problem