Domain permutation reduction for constraint satisfaction problems.
Martin James GreenDavid A. CohenPublished in: Artif. Intell. (2008)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- np complete
- constraint propagation
- combinatorial problems
- non binary
- search space
- constraint solving
- arc consistency
- domain independent
- computational problems
- constraint networks
- np hard
- partial constraint satisfaction
- arithmetic constraints
- finite domain
- forward checking
- tractable classes
- dynamic constraint satisfaction problems
- disjunctive temporal
- solving constraint satisfaction problems
- soft constraints
- domain specific
- arc consistency algorithm
- search algorithm
- tractable subclasses
- global constraints