An Experimental Evaluation of Max-SAT and PB Solvers on Over-Subscription Planning Problems.
Marco MarateaPublished in: RCRA@CPAIOR (2010)
Keyphrases
- planning problems
- max sat
- sat solvers
- maximum satisfiability
- boolean satisfiability
- heuristic search
- probabilistic planning
- weighted max sat
- domain independent
- sat problem
- sat instances
- state space
- constraint satisfaction
- orders of magnitude
- search space
- graph coloring
- search strategies
- sat encodings
- lower bound
- planning domains
- clause learning
- search algorithm
- satisfiability problem
- ai planning
- search tree
- branch and bound algorithm
- planning systems
- branch and bound
- tabu search
- unit propagation
- linear programming
- cnf formula
- classical planning