Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
Carmel DomshlakJörg HoffmannAshish SabharwalPublished in: J. Artif. Intell. Res. (2009)
Keyphrases
- sat solving
- sat encodings
- sat solvers
- boolean satisfiability
- sat problem
- planning problems
- sat instances
- cnf formula
- np complete
- satisfiability problem
- decision support
- phase transition
- boolean functions
- orders of magnitude
- conjunctive normal form
- motion planning
- constraint satisfaction problems
- max sat
- symmetry breaking
- propositional logic
- planning process
- plan execution
- high level
- heuristic search
- reinforcement learning