From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs.
Gadi SolotorevskyPublished in: CP (1996)
Keyphrases
- solving constraint satisfaction problems
- constraint satisfaction problems
- upper bound
- configuration problems
- dynamic constraint satisfaction problems
- backtracking algorithm
- constraint problems
- arc consistency
- partial constraint satisfaction
- worst case
- lower bound
- constraint satisfaction
- space complexity
- finding optimal solutions
- branch and bound
- distributed constraint satisfaction
- branch and bound algorithm
- randomly generated
- constraint programming
- combinatorial problems
- tree decomposition
- graph coloring problems
- symmetry breaking
- upper and lower bounds
- sat encodings
- constraint propagation
- constraint networks
- path consistency
- optimal solution
- search space
- np complete
- non binary
- global constraints
- distributed constraint satisfaction problems
- hypertree decomposition
- graph coloring
- np hard
- computational complexity
- objective function
- forward checking
- computational issues
- sat problem
- search tree
- search heuristics
- soft constraints