Abstract
Unlike symmetries weak symmetries act only on a subset of the variables and/or respect only a subset of the constraints of the problem. Therefore, weak symmetries preserve the state of feasibility only with respect to the subset of variables they act on and only for the constraints they respect. This means if two solutions are symmetric under the weak symmetry they yield different full solutions with potentially different feasibility states.
But weak symmetries cannot be simply broken, since this would result in a loss of solutions that cannot be derived afterwards. Therefore we propose a modelling technique that uses additional variables (SymVars) and constraints that enable us to express symmetric states of a solution. The idea is to decompose a problem P in a way such that the variables and constraints respected by the weak symmetry is present in one sub-problem P 1 and the rest in the sub-problem P 2. This way the weak symmetry acts as a common symmetry on P 1. The additional variables and constraints form a new sub-problem P sym that is incorporated and the solving order is to find a solution to P 1, consider a symmetric equivalent by P sym and pass the solution to P 2 which finds a solution for the whole problem. By doing so the symmetry on P 1 can be broken.
Although additional variables are introduced which extends the search space symmetry breaking enables us to reduce the search effort. Whether symmetry breaking does compensate the extension of the search space by the additional variables depends on the problem and the search heuristic. But as soon as a solution for P 1 is found the whole equivalence class of solutions can be considered via P sym .
Weak symmetries occur in various problems.They can be found in real-life problems (especially optimisation problems where the weak symmetry does not respect the objective value) as well as in in classic problem formulations like the magic square problem [1] or extensions of problems like the diagonal latin square [2] or the weighted magic square problem [3].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Martin, R., Weihe, K.: Solving the Magic Square Problem by Using Weak Symmetries. In: Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala (2005)
Harvey, W.: Symmetric Relaxation Techniques for Constraint Programming. 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, R., Weihe, K. (2005). Weak Symmetries in Problem Formulations. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_96
Download citation
DOI: https://doi.org/10.1007/11564751_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)