Accelerating SAT Based Planning with Incremental SAT Solving.
Stephan GochtTomás BalyoPublished in: ICAPS (2017)
Keyphrases
- sat solving
- sat solvers
- boolean satisfiability
- sat encodings
- constraint satisfaction
- sat problem
- orders of magnitude
- probabilistic planning
- search space
- max sat
- propositional satisfiability
- branch and bound algorithm
- search tree
- search strategies
- sat instances
- planning problems
- combinatorial problems
- symmetry breaking
- randomly generated
- constraint satisfaction problems
- integer linear programming
- graph coloring
- phase transition
- metaheuristic
- evolutionary algorithm