Abstract
In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and the weakly symmetric equivalent solutions preserve the feasibility state only with respect to a subset of the constraints. Therefore, breaking weak symmetries on the whole problem with standard techniques would lead to a loss of solutions. Weak symmetries occur in different application fields like planning, scheduling and manufacturing as well as in the fields of soft constraints. We introduce a technique that enables us to exploit weak symmetries and state experimental results on a real world problem to show the gain in using this technique.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gregory, P.: Almost–Symmetry in Planning. In: SymNet Workshop on Almost-Symmetry in Search, New Lanark (2005)
Donaldson, A.: Partial Symmetry in Model Checking. In: SymNet Workshop on Almost-Symmetry in Search, New Lanark (2005)
Martin, R.: Approaches to Symmetry Breaking for Weak Symmetries. In: SymNet Workshop on Almost-Symmetry in Search, New Lanark (2005)
Harvey, W.: Symmetric Relaxation Techniques for Constraint Programming. In: SymNet Workshop on Almost-Symmetry in Search, New Lanark (2005)
Harvey, W.: The Fully Social Golfer Problem. In: SymCon 2003: Third International Workshop in Constraint Satisfaction Problems, Kinsale, Ireland (2003)
Smith, B.M.: Reducing Symmetry in a Combinatorial Design Problem. School of Computing Research Report 2001.01, University of Leeds, Presented at the CP-AI-OR Workshop, April 2001 (January 2001)
Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, Springer, Heidelberg (1993)
Gent, I., Smith, B.: Symmetry Breaking in Constraint Programming. In: Horn, W. (ed.) Proceedings of the 14th European Conference on Artificial Intelligence, pp. 599–603 (2000)
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Kiziltan, Z.: Symmetry Breaking Ordering Constraints Dissertation Thesis, Uppsala University (2004)
Backofen, R., Will, S.: Excluding Symmetries in Constraint-Based Search. In: Principles and Practice of Constraint Programming, pp. 73–87 (1999)
Puget, J.-F.: Symmetry Breaking Using Stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 585–599. Springer, Heidelberg (2003)
Cohen, D., Jeavons, P.G., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17–31. Springer, Heidelberg (2005)
The GAP Group: GAP - Groups, Algorithms, and Programming, Version 4.3 (2002), http://www.gap-system.org
Gaudlitz, R.: Optimization Algorithms for Complex Mounting Machines in PC Board Manufacturing Diploma Thesis, Darmstadt University of Technology (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, R. (2006). The Challenge of Exploiting Weak Symmetries. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds) Recent Advances in Constraints. CSCLP 2005. Lecture Notes in Computer Science(), vol 3978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11754602_11
Download citation
DOI: https://doi.org/10.1007/11754602_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34215-1
Online ISBN: 978-3-540-34216-8
eBook Packages: Computer ScienceComputer Science (R0)