Lifting Structural Tractability to CSP with Global Constraints.
Evgenij ThorstensenPublished in: CP (2013)
Keyphrases
- global constraints
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- arc consistency
- np complete
- weighted constraint satisfaction
- boolean constraints
- combinatorial problems
- constraint propagation
- tractable classes
- constraint problems
- parameterized complexity
- constraint networks
- non binary
- boltzmann machine
- integer linear programming
- search space
- np hard
- computational complexity
- integer programming
- symmetry breaking
- soft constraints
- graph coloring
- computational problems
- point correspondences