Breaking Symmetry of Interchangeable Variables and Values

Abstract. A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric solutions introduced by such interchangeability. Unfortunately, whilst eliminating all symmetric solutions is tractable in this case, pruning all symmetric values is NP-hard. We introduce a new global constraint called SIGLEX and its GAC propagator for pruning some (but not necessarily all) symmetric values. We also investigate how different postings of the SIGLEX constraints affect the pruning performance during constraint solving. Finally, we test these static symmetry breaking constraints experimentally for the first time.

• Type: Conference
• Year: 2007
• Where: CP
• Authors: Yat Chiu Law, Jimmy Ho-Man Lee, Toby Walsh, J. Y. K. Yip
• Keywords: CP 2007, Programming Languages, Symmetric, Symmetric Solutions, Symmetric Values