Groupoids and Conditional Symmetry

We introduce groupoids - generalisations of groups in which not all pairs of elements may be multiplied, or, equivalently, categories in which all morphisms are invertible - as the appropriate algebraic structures for dealing with conditional symmetries in Constraint Satisfaction Problems (CSPs). We formally define the Full Conditional Symmetry Groupoid associated with any CSP, giving bounds for the number of elements that this groupoid can contain. We describe conditions under which a Conditional Symmetry sub-Groupoid forms a group, and, for this case, present an algorithm for breaking all conditional symmetries that arise at a search node. Our algorithm is polynomial-time when there is a corresponding algorithm for the type of group involved. We prove that our algorithm is both sound and complete - neither gaining nor losing solutions.

[1]  A. Weinstein.  Groupoids: unifying internal and external symmetry , 1996, math/9602220.

[2]  Barry O'Sullivan,et al.  Introduction to the Special Issue on Principles and Practice of Constraint Programming (CP 2005) , 2006, Constraints.

[3]  Eugene C. Freuder,et al.  Conditional interchangeability and substitutability ∗ , 2004 .

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

[5]  Peter Jeavons,et al.  Symmetry Definitions for Constraint Satisfaction Problems , 2005, CP.

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

[7]  Ian P. Gent,et al.  Symmetry in Constraint Programming , 2006, Handbook of Constraint Programming.

[8]  N. D. Gilbert.  Actions and expansions of ordered groupoids , 2005 .

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

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

[11]  Steve Linton,et al.  New Developments in Symmetry Breaking in Search Using Computational Group Theory , 2004, AISC.

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

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

[14]  Belaid Benhamou,et al.  Study of symmetry in Constraint Satisfaction Problems , 1994 .

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

[16]  Ronald Brown.  From Groups to Groupoids: a Brief Survey , 1987 .

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

[18]  Steve Linton,et al.  Conditional Symmetry Breaking , 2005, CP.

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

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

[21]  Frédéric Benhamou.  Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.

[22]  Ian P. Gent,et al.  Approaches to Conditional Symmetry Breaking ∗ , 2005 .

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

[24]  Guevara Noubir,et al.  On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems , 1998, AAAI/IAAI.