Temporally-Expressive Planning as Constraint Satisfaction Problems.
Yuxiao HuPublished in: ICAPS (2007)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- combinatorial problems
- solving planning problems
- np complete
- constraint programming
- problems in artificial intelligence
- search space
- planning problems
- arc consistency
- constraint solving
- non binary
- np hard
- sat problem
- constraint problems
- constraint networks
- global constraints
- temporal information
- constraint optimization
- decision support
- heuristic search
- solving constraint satisfaction problems
- decomposition methods
- finite domain
- forward checking
- partial constraint satisfaction
- pseudo boolean optimization
- disjunctive temporal
- disjunctive constraints
- backtracking search
- symmetry breaking
- soft constraints