Abstract
Constraint satisfaction problems (CSPs) are often highly symmetric. Given any solution, there are others which are equivalent in terms of the underlying problem being solved. Constraint programmers use symmetry breaking methods to exclude all but one in each equivalence class of solutions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Principles and Practice of Constraint Programming, pp. 73–87 (1999)
Gent, I.P., Harvey, W., Kelsey, T.: Groups and Constraints: Symmetry Breaking During Search. In: Principles and Practice of Constraint Programming, pp. 415–430 (2002)
Gent, P., Smith, B.M.: Symmetry breaking in constraint programming. In: Proceddings of ECAI-2002, pp. 599–603. IOS Press, Amsterdam (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petrie, K.E. (2003). Comparison of Symmetry Breaking Methods. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_114
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_114
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive