Solving QBF Instances with Nested SAT Solvers.
Bart BogaertsTomi JanhunenShahab TasharrofiPublished in: AAAI Workshop: Beyond NP (2016)
Keyphrases
- sat solvers
- boolean formula
- sat instances
- propositional satisfiability
- weighted max sat
- sat solving
- boolean satisfiability
- sat problem
- max sat
- orders of magnitude
- random sat instances
- search space
- search strategies
- constraint satisfaction
- conjunctive normal form
- search tree
- stochastic local search
- backtrack search
- randomly generated
- sat encodings
- davis putnam
- np complete
- constraint satisfaction problems
- membership queries
- satisfiability problem
- data structure
- symmetry breaking
- constraint programming
- boolean functions
- practical problems