∃-STRIPS: Existential Quantification in Planning and Constraint Satisfaction.
Guillem FrancèsHector GeffnerPublished in: IJCAI (2016)
Keyphrases
- constraint satisfaction
- heuristic search
- planning problems
- ai planning
- constraint satisfaction problems
- constraint propagation
- constraint relaxation
- phase transition
- relaxation labeling
- state space
- domain independent
- constraint programming
- search algorithm
- combinatorial problems
- arc consistency
- sat solvers
- genetic algorithm
- robust fault detection
- constraint networks
- probabilistic reasoning
- partial order planner
- constraint solving
- search space
- russian doll search
- constraint optimization
- soft constraints
- forward checking
- np hard
- planning domains
- max csp
- linear programming
- decision support
- search strategies