PASAR - Planning as Satisfiability with Abstraction Refinement.
Nils Christian FroleyksTomás BalyoDominik SchreiberPublished in: SOCS (2019)
Keyphrases
- abstraction hierarchy
- decision theoretic planning
- satisfiability problem
- high level
- sat solving
- planning problems
- decision support
- propositional logic
- mixed initiative
- query refinement
- computational complexity
- stochastic domains
- macro actions
- neural network
- refinement process
- multi agent
- quantified boolean formulas