Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems.
Eugene C. FreuderPaul D. HubbePublished in: IJCAI (1993)
Keyphrases
- disjunctive constraints
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- reducing the search space
- search space
- combinatorial problems
- constraint programming
- np complete
- constraint solving
- binary constraints
- sat problem
- global constraints
- decomposition methods
- np hard
- partial constraint satisfaction
- forward checking
- soft constraints
- arc consistency
- non binary
- finding optimal solutions