Efficient Algorithms for Strong Local Consistencies in Constraint Satisfaction Problems.
Anastasia PaparrizouPublished in: AAAI (2013)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- non binary
- constraint propagation
- arc consistency
- np complete
- combinatorial problems
- search space
- constraint networks
- soft constraints
- constraint solving
- sat problem
- computational problems
- np hard
- finite domain
- solving constraint satisfaction problems
- global constraints
- decomposition methods
- product configuration
- forward checking
- constraint solvers
- tractable subclasses
- computational complexity
- constraint graph
- graph coloring problems
- disjunctive temporal
- dynamic constraint satisfaction problems