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