SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.
Claudio CastelliniEnrico GiunchigliaArmando TacchellaPublished in: Artif. Intell. (2003)
Keyphrases
- complex domains
- planning domains
- constraint solver
- domain theory
- planning problems
- ai planning
- sat encodings
- bayesian networks
- reinforcement learning
- constraint satisfaction
- orders of magnitude
- domain independent
- answer set programming
- heuristic search
- linear constraints
- constraint solving
- htn planning
- constraint programming
- concurrency control
- constraint networks
- case based reasoning
- domain knowledge
- planning systems
- learning algorithm