A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints
Thierry Petit, Nicolas Beldiceanu, Xavier Lorca
This paper introduces the Seqbin meta-constraint with a polytime algorithm achieving generalized arc-consistency. Seqbin can be used for encoding counting constraints such as Change, Smooth, or InncreasingNValue. For all of them the time and space complexity is linear in the sum of domain sizes, which improves or equals the best known results of the literature.