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