Lightweight dynamic symmetry breaking

Symmetries in constraint problems present an opportunity for reducing search. This paper presents Lightweight Dynamic Symmetry Breaking, an automatic symmetry breaking method that is efficient enough to be used as a default, since it never yields a major slowdown while often giving major performance improvements. This is achieved by automatically exploiting certain kinds of symmetry that are common, can be compactly represented, easily and efficiently processed, automatically detected, and lead to large reductions in search. Moreover, the method is easy to implement and integrate in any constraint system. Experimental results show the method is competitive with the best symmetry breaking methods without risking poor performance.

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

[2]  Rolf Backofen,et al.  Excluding Symmetries in Constraint-Based Search , 1999, CP.

[3]  Y. Law,et al.  Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction , 2006, Constraints.

[4]  Steve Linton,et al.  Tractable Symmetry Breaking Using Restricted Search Trees , 2004, ECAI.

[5]  Jean-François Puget,et al.  Symmetry Breaking Revisited , 2002, Constraints.

[6]  Helmut Simonis,et al.  Partial symmetry breaking by local search in the group , 2012, Constraints.

[7]  Jean-François Puget.  Symmetry Breaking Using Stabilizers , 2003, CP.

[8]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[9]  Barbara M. Smith,et al.  Partial Symmetry Breaking , 2002, CP.

[10]  Iain McDonald.  Optimum Symmetry Breaking in CSPs Using Group Theory , 2001, CP.

[11]  Pascal Van Hentenryck,et al.  Static and Dynamic Structural Symmetry Breaking , 2006, CP.

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

[13]  Meinolf Sellmann,et al.  Model Restarts for Structural Symmetry Breaking , 2008, CP.

[14]  Warwick Harvey,et al.  Groups and Constraints: Symmetry Breaking during Search , 2002, CP.

[15]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[16]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[17]  Peter Jeavons,et al.  Symmetry Definitions for Constraint Satisfaction Problems , 2005, Constraints.

[18]  Bart Demoen,et al.  A Novel Approach For Detecting Symmetries in CSP Models , 2008, CPAIOR.

[19]  J. Davenport.  Editor , 1960 .

[20]  Steve Linton,et al.  Generic SBDD Using Computational Group Theory , 2003, CP.

[21]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

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

[23]  Joachim Schimpf,et al.  ECLiPSe: A Platform for Constraint Logic Programming , 1997 .

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

[25]  Pascal Van Hentenryck,et al.  Tractable Symmetry Breaking for CSPs with Interchangeable Values , 2003, IJCAI.

[26]  Toby Walsh,et al.  Breaking Symmetry of Interchangeable Variables and Values , 2007, CP.

[27]  Toby Walsh,et al.  CSPLIB: A Benchmark Library for Constraints , 1999, CP.

[28]  Pascal Van Hentenryck,et al.  Compositional Derivation of Symmetries for Constraint Satisfaction , 2005, SARA.

[29]  Pascal Van Hentenryck,et al.  Dynamic structural symmetry breaking for constraint satisfaction problems , 2009, Constraints.

[30]  Barbara M. Smith,et al.  Symmetry Breaking in Graceful Graphs , 2003, CP.