论文信息 - A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints

This paper introduces the SEQ BIN meta-constraint with a polytime algorithm achieving generalized arc-consistency. SEQ BIN can be used for encoding counting constraints such as CHANGE, SMOOTH, or INCREASING NVALUE. 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.

Xavier Lorca | Nicolas Beldiceanu | Thierry Petit

[1] Nicolas Beldiceanu,et al. Global Constraint Catalog , 2005 .

[2] Gilles Pesant,et al. A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[3] Gilles Pesant,et al. A Filtering Algorithm for the Stretch Constraint , 2001, CP.

[4] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[5] Mats Carlsson,et al. Global Constraint Catalog, 2nd Edition , 2010 .

[6] François Pachet,et al. Automatic Generation of Music Programs , 1999, CP.

[7] Gilles Pesant,et al. A Cost-Regular Based Hybrid Column Generation Approach , 2006, Constraints.

[8] Lars Hellsten,et al. Consistency Propagation for Stretch Constraints , 2004 .

[9] Christian Bessiere,et al. Constraint Propagation , 2006, Handbook of Constraint Programming.

[10] Xavier Lorca,et al. The Increasing Nvalue Constraint , 2010, CPAIOR.

[11] Toby Walsh,et al. SLIDE: A Useful Special Case of the CARDPATH Constraint , 2008, ECAI.