Combining restarts, nogoods and bag-connected decompositions for solving CSPs.
Philippe JégouCyril TerriouxPublished in: Constraints An Int. J. (2017)
Keyphrases
- constraint satisfaction problems
- backtracking search
- backtracking algorithm
- partial constraint satisfaction
- solving constraint satisfaction problems
- symmetry breaking
- constraint problems
- search tree
- dynamic constraint satisfaction problems
- constraint satisfaction
- search space
- decomposition methods
- constraint propagation
- hypertree decomposition
- graph coloring
- clause learning
- distributed constraint satisfaction
- distributed constraint satisfaction problems
- search problems
- combinatorial problems
- singular value decomposition
- sat encodings
- bag of words
- constraint networks
- arc consistency
- constraint programming
- sat solvers
- np complete
- search algorithm
- soft constraints
- special case
- finding optimal solutions
- linear programming
- global constraints
- configuration problems
- forward checking
- sat instances