Permutation Problems and Channelling Constraints [chapter]

Toby Walsh
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
more » ... also compare the constraint tightness in SAT encodings of these permutation problems. These results will aid users of constraints to choose a model for a permutation problem, and a local consistency property to enforce upon it. They also illustrate a methodology, as well as a measure of constraint tightness, that can be used to compare different constraint models.
doi:10.1007/3-540-45653-8_26 fatcat:iy64d2qn4zhw3iqxfdbkybygga