Abstract
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redundant search, since subtrees may be explored which are symmetric to subtrees already explored. To avoid this redundant search, constraint programmers have designed methods, which try to exclude all but one in each equivalence class of solutions. One problem with many of the symmetry breaking methods that eliminate all the symmetry is that they can have a large running overhead. To counter this flaw many CP practitioners have looked for methods that only eliminate a subset of the symmetries, so called partial symmetry breaking methods, but do so in an efficient manner. Partial symmetry breaking methods often work only when the problem is of a certain type. In this paper, we introduce a new method of finding a small set of constraints which provide very efficient partial symmetry breaking. This method works with all problem classes and modelling techniques.
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
Puget, J.F.: Automatic detection of variable and value symmetries. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 475–489. Springer, Heidelberg (2005)
Demoen, B., de la Banda, M.G., Mears, C., Wallace, M.: A novel approach for detecting symmetries in csp models. In: Proc. of The Seventh Intl. Workshop on Symmetry and Constraint Satisfaction Problems (2007)
Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Conf. ECAI 2006, pp. 98–102. IOS Press, Amsterdam (2006)
Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Proceedings of the 14th European Conference on Artificial Intelligence, ECAI 2000, Berlin, Germany, August 20-25, pp. 599–603. IOS Press, Amsterdam (2000)
Bjäreland, M., Jonsson, P.: Exploiting bipartiteness to identify yet another tractable subclass of CSP. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 118–128. Springer, Heidelberg (1999)
McDonald, I., Smith, B.: Partial symmetry breaking. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 431–445. Springer, Heidelberg (2002)
Gecode Team: Gecode: Generic constraint development environment (2006), http://www.gecode.org
Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Proc. of the Intl. Conference Principles of Knowledge Representation and Reasoning, pp. 148–159 (1996)
Puget, J.F.: Breaking symmetries in all different problems. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 272–277. Morgan Kaufmann Publishers Inc., San Francisco (2005)
Smith, B.M.: Sets of symmetry breaking constraints. In: Proc. Symcon, Agaoka (2005)
McKay, B.: Practical graph isomorphism. In: Numerical Mathematics and Computing, Proc. 10th Manitoba Conf., Winnipeg/Manitoba 1980, Congr. Numerantium, vol. 30, pp. 45–87 (1981), http://cs.anu.edu.au/people/bdm/nauty
Aloul, F.A., Sakallah, K.A., Markov, I.L.: Efficient symmetry breaking for boolean satisfiability. IEEE Transactions on Computers, 271–276 (2003)
Aloul, F., Ramani, A., Markov, I., Sakallah, K.: Solving difficult sat instances in the presence of symmetries. In: Proceedings of the Design Automation Conference, pp. 731–736 (2002)
Katsirelos, G., Narodytska, N., Walsh, T.: Breaking generator symmetry. In: The Ninth International Workshop on Symmetry and Constraint Satisfaction Problems (2009)
Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models (2002)
Katsirelos, G., Narodytska, N., Walsh, T.: On the complexity and completeness of static constraints for breaking row and column symmetry. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 305–320. Springer, Heidelberg (2010)
Jerrum, M.: A compact presentation for permutation groups. J. Algorithms 7, 71–90 (2002)
Seress, A.: Permutation group algorithms. Cambridge tracts in mathematics, vol. (152). Cambridge University Press, Cambridge (2002)
Mears, C., De La Banda, M.G., Wallace, M.: On implementing symmetry detection. Constraints 14, 443–477 (2009)
Petrie, K.E., Smith, B.M.: Symmetry breaking in graceful graphs. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 930–934. Springer, Heidelberg (2003)
Meseguer, P., Torras, C.: Solving strategies for highly symmetric csps. In: IJCAI (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jefferson, C., Petrie, K.E. (2011). Automatic Generation of Constraints for Partial Symmetry Breaking. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)