Abstract
In this paper, we propose a general technique for removing symmetries in CSPs during search. The idea is to record no-goods, during the exploration of the search tree, whose symmetric counterpart (if any) should be removed. The no-good, called Global Cut Seed (GCS), is used to generate Symmetry Removal Cuts (SRCs), i.e., constraints that are dynamically generated during search and hold in the entire search tree. The propagation of SRCs removes symmetric configurations with respect to already visited states. We present a general, correct and complete filtering algorithm for SRCs. The main advantages of the proposed approach are that it is not intrusive in the problem-dependent search strategy, treats symmetries in an additive way since GCSs are symmetry independent, and enables to write filtering algorithms which handle families of symmetries together. Finally, we show that many relevant previous approaches can be seen as special cases of our framework.
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
F. Bacchus. A uniform view of backtracking. In Unpublished manuscript, 2000. http://www.cs.toronto.edu/~fbacchus/on-line.
R. Backofen and S. Will. Excluding symmetries in constraint based search. In Proceedings CP’99, pages 400–405, 1999.
B. Benhamou. Study of symmetries in constraint satisfaction problems. In Proceedings of PPCP’94, LNCS-Springer Verlag, 1994.
F. Focacci. Solving Combinatorial Optimization Problems in Constraint Programming. PhD thesis, Fac. Ingegneria, Universita’ di Ferrara, Italy, 2001. http://www-lia.deis.unibo.it/Research/TechReport/lia01005.zip.
E. Freuder. Eliminating interchangeble values in constraint satisfaction problems. In Proceedings AAAI’91, pages 227–233, 1991.
I. P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In TR 99.02 School of Computer Studies, 1999.
I. P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In W. Horn, editor, Proceedings ECAI2000, pages 599–603, 2000.
W. Harvey and M. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence-IJCAI, pages 607–615. Morgan Kaufmann, 1995.
P. Meseguer and C. Torras. Solving strategies for highly symmetric csps. In Proceedings IJCAI’99, pages 400–405, 1999.
P. Meseguer and C. Torras. Exploiting symmetries within constraint satisfaction search. Journal of Artificial Intelligence, 129:133–163, 2001.
M Padberg and G Rinaldi. Optimization of a 532-symmetric traveling salesman problem. Operations Research Letters, 6:1–8, 1987.
J. F. Puget. On the satisfiability of symmetrical constraint satisfaction problems. In Proceedings ISMIS’93, pages 350–361, 1993.
P. Roy and F. Pachet. Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Proceedings of ECAI98 Workshop on Non Binary Constraints, pages 27–33, 1998.
B. Smith. Reducing symmetries in a combinatorial design problem. In Proceedings CPAIOR01, 2001.
T. Walsh. Depth-bounded discrepancy search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence-IJCAI. Morgan Kaufmann, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Focacci, F., Milano, M. (2001). Global Cut Framework for Removing Symmetries. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive