On Reformulation of Constraint Satisfaction Problems.
Rainer WeigelChristian BliekPublished in: ECAI (1998)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- search space
- np complete
- np hard
- non binary
- constraint networks
- combinatorial problems
- constraint solving
- solving constraint satisfaction problems
- soft constraints
- decomposition methods
- disjunctive temporal
- arc consistency
- sat problem
- forward checking
- tractable subclasses
- partial constraint satisfaction