Sciweavers

COMPULOG
1999
Springer
14 years 3 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh