On Q-Resolution and CDCL QBF Solving.
Mikolas JanotaPublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- sat solvers
- clause learning
- sat encodings
- boolean formula
- sat solving
- boolean satisfiability
- propositional satisfiability
- sat problem
- max sat
- quantified boolean formulas
- sat instances
- constraint satisfaction
- orders of magnitude
- unit propagation
- solving problems
- graph coloring
- np hard
- evolutionary algorithm
- computational complexity
- combinatorial problems
- industrial applications
- constraint satisfaction problems
- davis putnam