On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry

We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove that we can compute in polynomial time a unique representative of an equivalence class in a matrix model with row and column symmetry if the number of rows (or of columns) is bounded and in a number of other special cases. On the negative side, we show that whilst DOUBLELEX and SNAKELEX are often effective in practice, they can leave a large number of symmetric solutions in the worst case. In addition, we prove that propagating DOUBLELEX completely is NP-hard. Finally we consider how to break row, column and value symmetry, correcting a result in the literature about the safeness of combining different symmetry breaking constraints. We end with the first experimental study on how much symmetry is left by DOUBLELEX and SNAKELEX on some benchmark problems.

[1]  Jean-François Puget,et al.  Breaking All Value Symmetries in Surjection Problems , 2005, CP.

[2]  Toby Walsh,et al.  Multiset Ordering Constraints , 2003, IJCAI.

[3]  Andrew Grayland,et al.  Snake Lex: An Alternative to Double Lex , 2009, CP.

[4]  Ian P. Gent,et al.  Symmetry Breaking in Constraint Programming , 2000, ECAI.

[5]  Toby Walsh,et al.  Breaking Generator Symmetry , 2009, ArXiv.

[6]  P. Flener,et al.  Symmetry in matrix models , 2001 .

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

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

[9]  T. Walsh,et al.  Matrix Modelling , 2001 .

[10]  Jean-François Puget.  Breaking symmetries in all different problems , 2005, IJCAI.

[11]  Anna Lubiw,et al.  Doubly Lexical Orderings of Matrices , 1987, SIAM J. Comput..

[12]  Ian Miguel,et al.  Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics , 2009, CP.

[13]  Steven David Prestwich,et al.  Constraint Models for the Covering Test Problem , 2006, Constraints.

[14]  Ilya Shlyakhter,et al.  Generating effective symmetry-breaking predicates for search problems , 2001, Discrete Applied Mathematics.

[15]  Jimmy Ho-Man Lee,et al.  Global Constraints for Integer and Set Value Precedence , 2004, CP.

[16]  Toby Walsh.  Symmetry Breaking Using Value Precedence , 2006, ECAI.

[17]  Nicolas Beldiceanu,et al.  Arc-Consistency for a Chain of Lexicographic Ordering Constraints , 2002 .

[18]  Ian Miguel,et al.  Constraints for Breaking More Row and Column Symmetries , 2003, CP.

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

[20]  Toby Walsh,et al.  Breaking Row and Column Symmetries in Matrix Models , 2002, CP.

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