Abstract
In this paper we define partial symmetry breaking, a concept that has been used in many previous papers without being the main topic of any research. This paper is the first systematic study of partial symmetry breaking in constraint programming. We show experimentally that performing symmetry breaking with only a subset of all symmetries can result in greatly reduced run-times. We also look at the consequences of using partial symmetry breaking in terms of variable and value ordering heuristics. Finally, different methods of selecting symmetries are considered before presenting a general algorithm for selecting subsets of symmetries.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rolf Backofen and Sebastian Will. Excluding symmetries in constraint-based search. In Alex Brodsky, editor, Principles and Practice of Constraint Programming, pages 73–87. Springer-Verlag, 1999.
Torsten Fahle, Stefan Schamberger, and Meinolf Sellman. Symmetry breaking. In Toby Walsh, editor, Principles and Practice of Constraint Programming-CP2001, pages 93–107. Springer-Verlag, 2001.
James Crawford, Matthew Ginsberg, Eugene Luks, and Amitabha Roy. Symmetry-breaking predicates for search problems. In Knowledge Representation’96: Principles of Knowledge Representation and Reasoning, pages 148–159. Morgan Kaufmann, San Francisco, California, 1996.
Pedro Meseguer and Carme Torras. Exploiting symmetries within constraint satisfaction search. In Artificial Intelligence, Vol 129, No. 1-2, pages 133–163. 2001.
Ian Gent and Barbara Smith. Symmetry breaking in constraint programming. In W. Horn, editor, Proceedings of ECAI-2000, pages 599–603. IOS Press, 2000.
Filippo Focacci and Michaela Milano. Global cut framework for removing symmetries. In Toby Walsh, editor, Principles and Practice of Constraint Programming-CP2001, pages 77–92. Springer-Verlag, 2001.
Warwick Harvey. Symmetry breaking and the social golfer problem. In Piere Flener and Justin Pearson, editors, SymCon’01: Symmetry in Constraints, pages 9–16, 2001. Available from http://www.csd.uu.se/~pierref/astra/symmetry/index.html.
Iain McDonald. Unique symmetry breaking in CSPs using group theory. In Piere Flener and Justin Pearson, editors, SymCon’01: Symmetry in Constraints, pages 75–78, 2001. Available from http://www.csd.uu.se/~pierref/astra/symmetry/index.html.
Cynthia Brown, Larry Finkelstein, and Paul Purdom Jr. Backtrack searching in the presence of symmetry. In Nordic Journal of Computing, pages 203–219. Publishing Association Nordic Journal of Computing, 1996.
Barbara Smith. Reducing symmetry in a combinatorial design problem. Technical Report Research Report 2001.01, University of Leeds, January 2001.
Ian Gent, Steve Linton, and Barbara Smith. Symmetry breaking in the alien tiles puzzle. Technical Report APES-22-2000, APES Research Group, October 2000. Available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html.
The GAP Group, Aachen, St Andrews. GAP-Groups, Algorithms, and Programming, Version 4.2, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McDonald, I., Smith, B. (2002). Partial Symmetry Breaking. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive