Limit Behavior of Locally Consistent Constraint Satisfaction Problems.
Manuel BodirskyDaniel Král'Published in: SIAM J. Discret. Math. (2011)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- combinatorial problems
- np complete
- constraint solving
- arc consistency
- soft constraints
- non binary
- np hard
- temporal constraints
- pseudo boolean optimization
- arithmetic constraints
- product configuration
- global constraints
- tractable subclasses
- partial constraint satisfaction
- constraint networks
- forward checking
- constraint graph
- arc consistency algorithm
- solving constraint satisfaction problems
- disjunctive constraints
- computational problems
- disjunctive temporal
- finite domain
- constraint optimization
- backtracking search
- temporal information
- finding optimal solutions
- maintaining arc consistency
- sat problem
- weighted constraint satisfaction