Mapping Conformant Planning into SAT Through Compilation and Projection.
Héctor PalaciosHector GeffnerPublished in: CAEPIA (2005)
Keyphrases
- conformant planning
- symbolic model checking
- computationally hard
- belief space
- forward search
- initial state
- satisfiability problem
- finite domain
- classical planning
- sat problem
- planning problems
- model checking
- search algorithm
- belief state
- symbolic representation
- sat solvers
- partial observability
- heuristic search
- formal verification
- phase transition
- constraint programming