Symmetries of Symmetry Breaking Constraints
Abstract
Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry class. This simple but powerful idea can be used in a number of different ways. We describe one application within model restarts, a search technique designed to reduce the conflict between symmetry breaking and the branching heuristic. In model restarts, we restart search periodically with a random symmetry of the symmetry breaking constraints. Experimental results show that this symmetry breaking technique is effective in practice on some standard benchmark problems.
Keywords
Cite
@article{arxiv.1005.5270,
title = {Symmetries of Symmetry Breaking Constraints},
author = {George Katsirelos and Toby Walsh},
journal= {arXiv preprint arXiv:1005.5270},
year = {2010}
}
Comments
To appear in Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010). Revises workshop paper that appears at SymCon 2009