Constraint Satisfaction Problems: Convexity Makes AllDifferent Constraints Tractable.
Michael R. FellowsTobias FriedrichDanny HermelinNina NarodytskaFrances A. RosamondPublished in: IJCAI (2011)
Keyphrases
- constraint satisfaction problems
- global constraints
- arc consistency
- constraint satisfaction
- binary constraints
- constraint programming
- tractable classes
- np complete
- arc consistency algorithm
- computational problems
- non binary
- np hard
- constraint networks
- constraint solving
- solving constraint satisfaction problems
- constraint propagation
- combinatorial problems
- finite domain
- soft constraints
- search space
- disjunctive temporal
- constraint problems
- maintaining arc consistency
- constraint solver
- weighted constraint satisfaction
- constraint graph
- hard constraints
- decomposition methods
- path consistency
- constraint solvers
- computational complexity
- arithmetic constraints
- interval algebra
- sat problem
- disjunctive constraints
- temporal constraints
- constraint optimization
- configuration problems
- forward checking
- partial assignment
- symmetry breaking
- linear programming
- reasoning problems
- backtracking search
- space complexity