A Novel Approach For Detecting Symmetries in CSP Models

While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetries in CSP models are limited to the kind of symmetries that can be inferred from the global constraints present in the model. Herein, a new approach for detecting symmetries in CSP models is presented. The approach is based on first applying powerful methods to a sequence of problem instances, and then reasoning on the resulting instance symmetries to infer symmetries of the model. Our results show that this approach deserves further exploration.

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

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

[3]  Pascal Van Hentenryck,et al.  Structural Symmetry Breaking , 2005, IJCAI.

[4]  Pierre Flener,et al.  Introducing ESRA, a Relational Language for Modelling Combinatorial Problems , 2003, CP.

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

[6]  Christopher Mears,et al.  On implementing symmetry detection , 2009, Constraints.

[7]  Jean-François Puget,et al.  Automatic Detection of Variable and Value Symmetries , 2005, CP.

[8]  Alan Smaill,et al.  Proceedings of the 14th European Conference on Artificial Intelligence (ECAI 2000) , 2000 .

[9]  Igor L. Markov,et al.  Automatically Exploiting Symmetries in Constraint Programming , 2004, CSCLP.

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

[11]  Toby Walsh,et al.  General Symmetry Breaking Constraints , 2006, CP.

[12]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

[13]  Warwick Harvey,et al.  Essence: A constraint language for specifying combinatorial problems , 2007, Constraints.

[14]  Alois Haselböck,et al.  Exploiting Interchangeabilities in Constraint-Satisfaction Problems , 1993, IJCAI.

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

[16]  Toni Mancini,et al.  Detecting and Breaking Symmetries by Reasoning on Problem Specifications , 2005, SARA.

[17]  Kim Marriott,et al.  The Modelling Language Zinc , 2006, CP.

[18]  Toby Walsh,et al.  CGRASS: A System for Transforming Constraint Satisfaction Problems , 2002, International Workshop on Constraint Solving and Constraint Logic Programming.

[19]  François Pachet,et al.  Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems , 2002 .

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

[21]  J. Davenport.  Editor , 1960 .

[22]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .