Asymptotically Optimal Encodings of Conformant Planning in QBF.
Jussi RintanenPublished in: AAAI (2007)
Keyphrases
- asymptotically optimal
- conformant planning
- planning problems
- symbolic model checking
- computationally hard
- initial state
- forward search
- finite domain
- belief space
- conjunctive normal form
- optimal policy
- state space
- ai planning
- domain independent
- heuristic search
- arrival rate
- classical planning
- partial observability
- model checking
- sat instances
- decision problems
- orders of magnitude
- planning domains
- constraint programming
- sat solvers
- call center
- satisfiability problem
- utility function
- constraint satisfaction problems