Decomposition of the NValue Constraint

We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposition can simulate with the same time complexity but with a much greater space complexity. This suggests that the benefit of a global propagator may often not be in saving time but in saving space. Our other theoretical contribution is to show for the first time that range consistency can be enforced on NVALUE with the same worst-case time complexity as bound consistency. Finally, the decompositions we study are readily encoded as linear inequalities. We are therefore able to use them in integer linear programs.

[1]  L. Smith,et al.  To be or Not to Be , 1957, Journal of psychiatric nursing and mental health services.

[2]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[3]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[4]  Jean-François Puget,et al.  A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.

[5]  Toby Walsh,et al.  The Difference All-Difference Makes , 1999, IJCAI.

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

[7]  Nicolas Beldiceanu.  Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family , 2001, CP.

[8]  William D. Weakley,et al.  Values of Domination Numbers of the Queen's Graph , 2001, Electron. J. Comb..

[9]  Pascal Van Hentenryck,et al.  To Be or Not to Be ... a Global Constraint , 2003, CP.

[10]  Toby Walsh,et al.  The Complexity of Global Constraints , 2004, AAAI.

[11]  Nicolas Beldiceanu,et al.  Filtering Algorithms for the Same Constraint , 2004, CPAIOR.

[12]  Toby Walsh,et al.  The Range and Roots Constraints: Specifying Counting and Occurrence Problems , 2005, IJCAI.

[13]  Mats Carlsson,et al.  Reformulation of Global Constraints Based on Constraints Checkers , 2005, Constraints.

[14]  Toby Walsh,et al.  The Complexity of Reasoning with Global Constraints , 2007, Constraints.

[15]  Toby Walsh,et al.  Filtering Algorithms for the NValue Constraint , 2006, Constraints.

[16]  Gilles Pesant,et al.  Revisiting the Sequence Constraint , 2006, CP.

[17]  Toby Walsh,et al.  The Range Constraint: Algorithms and Implementation , 2006, CPAIOR.

[18]  Toby Walsh,et al.  The ROOTS Constraint , 2006, CP.

[19]  Gilles Pesant,et al.  On global warming: Flow-based soft global constraints , 2006, J. Heuristics.

[20]  Toby Walsh,et al.  Global Grammar Constraints , 2006, CP.

[21]  Toby Walsh,et al.  Encodings of the Sequence Constraint , 2007, CP.

[22]  Toby Walsh,et al.  Decomposing Global Grammar Constraints , 2007, CP.

[23]  Peter J. Stuckey,et al.  Propagation = Lazy Clause Generation , 2007, CP.

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

[25]  Christian Bessiere,et al.  The Parameterized Complexity of Global Constraints , 2008, AAAI.

[26]  Toby Walsh,et al.  Decompositions of All Different, Global Cardinality and Related Constraints , 2009, IJCAI.

[27]  Toby Walsh,et al.  Circuit Complexity and Decompositions of Global Constraints , 2009, IJCAI.