Abstract
Symmetries in constraint satisfaction problems (CSPs) are one of the difficulties that practitioners have to deal with. We present in this paper a new method based on the symmetries of decisions taken from the root of the search tree. This method can be seen as an improvement of the nogood recording presented by Focacci and Milano[5] and Fahle, Schamberger and Sellmann[4]. We present a simple formalization of our method for which we prove correctness and completeness results. We also show that our method is theoretically more efficient as the number of dominance checks, the number of nogoods and the size of each nogood are smaller. This is confirmed by an experimental evaluation on the social golfer problem, a very difficult and highly symmetrical real world problem. We are able to break all symmetries for problems with more than 1036 symmetries. We report both new results, and a comparison with previous work.
This is a preview of subscription content, log in via an institution to check access.
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
Backofen, R., Will, S.: Excluding Symmetries in Constraint Based Search. Proceedings of CP’99 (1999).
Benhamou, B.: Study of Symmetries in Constraint Satisfaction Problems. Proceedings of PPCP’94 (1994).
Gent, I. P., Walsh, T., Sellmann, B.: CSPlib http://www-users.cs.york.ac.uk/~tw/csplib/.
Fahle, T., Shamberger, S., Sellmann, M.: Symmetry Breaking. Proceedings of CP01 (2001) 93–107.
Focacci, F., Milano, M.: Global Cut Framework for Removing Symmetries. Proceedings of CP01 (2001) 75–92.
Gent, I.P., and Harvey, W., and Kelsey, T.: Groups and Constraints: Symmetry Breaking During Search, Technical report APES-48-2002, APES Research Group (2002).
Gent, I.P., and Linton, S.A., and Smith, B.M.: Symmetry Breaking in the Alien Tiles Puzzle, Technical report APES-22-2000, APES Research Group (1999).
Gent, I.P., and Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. Proceedings ECAI’2000, pp. 599–603.
Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a practical language. Constraints, An International Journal, (1997), vol 1. 191–246.
Harvey, W.: Symmetry Breaking and the Social Golfer Problem CP01 Workshop on Symmetries (2001).
McDonald, I., Smith, B.: Partial Symmetry Breaking, Technical report APES-49-2002, APES Research Group (2002).
Meseguer, P., Torras, C.: Exploiting Symmetries Within Constraint Satisfaction Search. Art.Intell. 129 (1999) 133–163.
Puget, J.-F.: On the Satisfiability of Symmetrical Constraint Satisfaction Problems. Proceedings of ISMIS’93 (1993), 350–361.
Puget, J.F.: Finite Set Intervals. Workshop on Set Constraints, CP’96, (1996).
Rothberg, E.: Using cuts to remove symmetry. In proceedings of ISMP 2000, Atlanta.
Roy, P., Pachet, F.: Using Symmetry of Global Constraints to Speed Up the Resolution of Constraint Satisfaction Problems. Proceedings of ECAI’98 workshop on Non Binary Constraints (1998) 27–33.
Sellmann, M., Harvey, W.: Heuristic Constraint Propagation Proceedings of CPAIOR’02 workshop (2002) 191–204.
Smith, B.M.: Reducing Symmetry in a Combinatorial Design Problem Research Report 2001.01, January 2001. Presented at the CP-AI-OR Workshop, April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Puget, JF. (2002). Symmetry Breaking Revisited. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive