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
.
Permutation Problems and Channelling Constraints
[chapter]
2001
Lecture Notes in Computer Science
We perform an extensive study of several different models of permutation problems proposed by Smith in [Smith, 2000] . We first define a measure of constraint tightness parameterized by the level of local consistency being enforced. We then compare the constraint tightness in these different models with respect to a large number of local consistency properties including arc-consistency, (restricted) path-consistency, path inverse consistency, singleton arc-consistency and bounds consistency. We
doi:10.1007/3-540-45653-8_26
fatcat:iy64d2qn4zhw3iqxfdbkybygga