Combining Restarts, Nogoods and Decompositions for Solving CSPs.
Philippe JégouCyril TerriouxPublished in: ECAI (2014)
Keyphrases
- constraint satisfaction problems
- backtracking search
- backtracking algorithm
- constraint problems
- partial constraint satisfaction
- symmetry breaking
- solving constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- dynamic constraint satisfaction problems
- constraint propagation
- search space
- search tree
- hypertree decomposition
- distributed constraint satisfaction problems
- arc consistency
- non binary
- finding optimal solutions
- random walk
- constraint programming
- temporal constraints
- solving problems
- search problems
- np complete
- clause learning
- combinatorial problems
- soft constraints
- global constraints
- branch and bound algorithm
- combinatorial optimization
- orders of magnitude
- np hard
- special case