Planning for Temporally Extended Goals as Propositional Satisfiability.
Robert MattmüllerJussi RintanenPublished in: IJCAI (2007)
Keyphrases
- temporally extended goals
- propositional satisfiability
- temporal logic
- heuristic search
- symbolic model checking
- model checking
- sat solvers
- satisfiability problem
- linear temporal logic
- temporally extended
- propositional logic
- automated reasoning
- sat problem
- classical planning
- sat instances
- planning domains
- constraint programming
- stochastic local search
- planning problems
- modal logic
- industrial applications
- constraint satisfaction
- max sat
- ai planning
- state space
- belief revision
- genetic algorithm
- search strategies
- evolutionary algorithm
- search space
- domain independent
- reinforcement learning