Parallel Encodings of Classical Planning as Satisfiability.
Jussi RintanenKeijo HeljankoIlkka NiemeläPublished in: JELIA (2004)
Keyphrases
- planning problems
- classical planning
- sat encodings
- domain independent
- heuristic search
- state space
- larger problems
- satisfiability problem
- planning domains
- computational complexity
- sat instances
- ai planning
- initial state
- np complete
- probabilistic planning
- temporal planning
- sensing actions
- domain specific
- conformant planning
- deterministic domains
- sat solvers
- phase transition
- search space