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