Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable.
Michael R. FellowsTobias FriedrichDanny HermelinNina NarodytskaFrances A. RosamondPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- constraint satisfaction problems
- global constraints
- arc consistency
- constraint satisfaction
- binary constraints
- constraint programming
- np complete
- tractable classes
- arc consistency algorithm
- non binary
- computational problems
- constraint networks
- constraint solving
- combinatorial problems
- np hard
- soft constraints
- solving constraint satisfaction problems
- constraint solver
- constraint propagation
- maintaining arc consistency
- constraint problems
- search space
- disjunctive temporal
- disjunctive constraints
- constraint graph
- finite domain
- path consistency
- dynamic constraint satisfaction problems
- hard constraints
- backtracking search
- weighted constraint satisfaction
- forward checking
- interval algebra
- space complexity
- constraint optimization
- backtracking algorithm
- decomposition methods
- sat problem
- reducing the search space
- reasoning problems
- constraint logic programming
- sat encodings
- variable ordering heuristics
- partial constraint satisfaction