Global Cut Framework for Removing Symmetries
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.
KeywordsSymmetric Solution Constraint Program Constraint Satisfaction Problem Unary Constraint Left Branch
Unable to display preview. Download preview PDF.
- 1.F. Bacchus. A uniform view of backtracking. In Unpublished manuscript, 2000. http://www.cs.toronto.edu/~fbacchus/on-line.
- 2.R. Backofen and S. Will. Excluding symmetries in constraint based search. In Proceedings CP’99, pages 400–405, 1999.Google Scholar
- 3.B. Benhamou. Study of symmetries in constraint satisfaction problems. In Proceedings of PPCP’94, LNCS-Springer Verlag, 1994.Google Scholar
- 4.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.
- 5.E. Freuder. Eliminating interchangeble values in constraint satisfaction problems. In Proceedings AAAI’91, pages 227–233, 1991.Google Scholar
- 6.I. P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In TR 99.02 School of Computer Studies, 1999.Google Scholar
- 7.I. P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In W. Horn, editor, Proceedings ECAI2000, pages 599–603, 2000.Google Scholar
- 8.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.Google Scholar
- 9.P. Meseguer and C. Torras. Solving strategies for highly symmetric csps. In Proceedings IJCAI’99, pages 400–405, 1999.Google Scholar
- 12.J. F. Puget. On the satisfiability of symmetrical constraint satisfaction problems. In Proceedings ISMIS’93, pages 350–361, 1993.Google Scholar
- 13.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.Google Scholar
- 14.B. Smith. Reducing symmetries in a combinatorial design problem. In Proceedings CPAIOR01, 2001.Google Scholar
- 15.T. Walsh. Depth-bounded discrepancy search. In Proceedings of the 15th International Joint Conference on Artificial Intelligence-IJCAI. Morgan Kaufmann, 1997.Google Scholar