Abstract
Symmetry-breaking in constraint satisfaction problems is a well-established area of AI research which has recently developed strong interactions with symbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in constraint satisfication problems. In this paper we analyse the structure of symmetry groups of constraint satisfaction problems, and implement several combinations of GE-trees and the classical SBDD method for breaking all symmetries. We prove the efficacy of our techniques, and present preliminary experimental evidence of their practical efficiency.
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
Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)
Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Proceedings, GP 1999, pp. 73–87. Springer, Heidelberg (1999)
Gent, L., Smith, B.M.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) Proc. ECAI 2000, pp. 599–603. IOS Press, Amsterdam (2000)
Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 93–107. Springer, Heidelberg (2001)
Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 77–92. Springer, Heidelberg (2001)
Gent, I.P., Harvey, W., Kelsey, T.: Groups and constraints: Symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 415–430. Springer, Heidelberg (2002)
Gent, L., Harvey, W., Kelsey, T., Linton, S.A.: Generic SBDD using computational group theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 333–347. Springer, Heidelberg (2003)
Wallace, M.G., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal 12(1), 159–200 (1997)
The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.2 (2000), http://www.gap-system.org
Colva, M., Roney-Dougal, I.P.: Gent, Tom Kelsey, and Steve A. Linton. Tractable symmetry breaking using restricted search trees. In: Proceedings, ECAI 2004 (2004) (to appear)
Seress, A.: Permutation group algorithms. Cambridge tracts in mathematics, vol. 152. Cambridge University Press, Cambridge (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kelsey, T., Linton, S., Roney-Dougal, C. (2004). New Developments in Symmetry Breaking in Search Using Computational Group Theory. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30210-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23212-4
Online ISBN: 978-3-540-30210-0
eBook Packages: Springer Book Archive