A SAT-based solver for Q-ALL SAT.
Ben BrowningAnja RemshagenPublished in: ACM Southeast Regional Conference (2006)
Keyphrases
- sat solvers
- sat solving
- boolean satisfiability
- constraint solver
- sat encodings
- clause learning
- boolean formula
- unit propagation
- sat problem
- weighted max sat
- propositional satisfiability
- orders of magnitude
- satisfiability modulo theories
- sat instances
- max sat
- search strategies
- constraint satisfaction
- search tree
- search space
- satisfiability problem
- branch and bound algorithm
- probabilistic planning
- quantified boolean formulas
- graph coloring
- randomly generated
- classical planning
- symmetry breaking
- stochastic local search algorithms
- boolean variables
- integer linear programming
- search methods
- constraint solving