A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Decomposable Constraints
[chapter]
2000
Lecture Notes in Computer Science
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the "all-different" and "global cardinality" constraints. Certain classes of these non-binary constraints are "network decomposable" as they can be represented by binary constraints on the same set of variables. We compare theoretically the levels of consistency which are achieved on non-binary constraints to those achieved on their binary decomposition. We present many new results
doi:10.1007/3-540-44654-0_7
fatcat:vhx47bm7e5egheubxcknqbubz4