Breaking symmetry of interchangeable variables and values

18Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Law, Y. C., Lee, J. H. M., Walsh, T., & Yip, J. Y. K. (2007). Breaking symmetry of interchangeable variables and values. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 423–437). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free