The Parameterized Complexity of Global Constraints

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them fixed-parameter tractable and which are easy to compute. This tractability tends either to be the result of a simple dynamic program or of a decomposition which has a strong backdoor of bounded size. This strong backdoor is often a cycle cutset. We also show that parameterized complexity can be used to study other aspects of constraint programming like symmetry breaking. For instance, we prove that value symmetry is fixed-parameter tractable to break in the number of symmetries. Finally, we argue that parameterized complexity can be used to derive results about the approximability of constraint propagation.

[1]  Martin C. Cooper,et al.  Characterising Tractable Constraints , 1994, Artif. Intell..

[2]  Nicolas Beldiceanu,et al.  Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type , 2000, CP.

[3]  Mats Carlsson,et al.  Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family , 2001, ICLP.

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

[5]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Toby Walsh,et al.  Global Constraints for Lexicographic Orderings , 2002, CP.

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

[9]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

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

[11]  Meinolf Sellmann.  Approximated Consistency for Knapsack Constraints , 2003, CP.

[12]  Toby Walsh,et al.  Among, Common and Disjoint Constraints , 2005, CSCLP.

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

[14]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[15]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

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

[17]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[18]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[19]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[20]  Philippe Baptiste,et al.  Runway sequencing with holding patterns , 2008, Eur. J. Oper. Res..

[21]  Marko Samer,et al.  Tractable cases of the extended global cardinality constraint , 2009, Constraints.

[22]  Toby Walsh.  Breaking Value Symmetry , 2007, CP.

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

[24]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[25]  Jean-Charles Régin,et al.  A Global Constraint Combining a Sum Constraint and Difference Constraints , 2000, CP.

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

[27]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

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

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

[30]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.