When Functional and Bijective Constraints Make a CSP Polynomial.
Philippe DavidPublished in: IJCAI (1993)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- constraint programming
- arc consistency algorithm
- constraint solving
- constraint networks
- combinatorial problems
- constraint propagation
- solving constraint satisfaction problems
- decomposition methods
- global constraints
- disjunctive temporal
- constraint graph
- finite domain
- path consistency
- constrained optimization
- constraint solver
- sat encodings
- arc consistency
- co occurrence