A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems.
David A. CohenMarc GyssensPeter JeavonsPublished in: Complexity of Constraints (2006)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- np complete
- arc consistency
- constraint solving
- non binary
- pseudo boolean optimization
- combinatorial problems
- np hard
- backtracking search
- product configuration
- computational problems
- soft constraints
- solving constraint satisfaction problems
- constraint networks
- disjunctive temporal
- constraint solver
- finite domain
- constraint optimization
- heuristic search
- weighted constraint satisfaction
- partial constraint satisfaction
- arithmetic constraints
- search tree
- constraint solvers
- binary constraints
- forward checking
- symmetry breaking
- temporal constraints
- decomposition methods
- sat problem