A unified theory of structural tractability for constraint satisfaction problems.
David A. CohenPeter JeavonsMarc GyssensPublished in: J. Comput. Syst. Sci. (2008)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- constraint problems
- constraint programming
- constraint propagation
- search space
- non binary
- arc consistency
- tractable classes
- soft constraints
- decomposition methods
- np hard
- constraint networks
- computational problems
- global constraints
- combinatorial problems
- sat problem
- product configuration
- constraint optimization
- constraint solving
- set bounds propagation
- randomly generated
- constraint graph
- forward checking
- bounded treewidth
- search algorithm
- state space