Abstract
While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetries in CSP models are limited to the kind of symmetries that can be inferred from the global constraints present in the model. Herein, a new approach for detecting symmetries in CSP models is presented. The approach is based on first applying powerful methods to a sequence of problem instances, and then reasoning on the resulting instance symmetries to infer symmetries of the model. Our results show that this approach deserves further exploration.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cohen, D., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Satisfaction Problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17–31. Springer, Heidelberg (2005)
Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting Structure in Symmetry Generation for CNF. In: 41st Design Automation Conference, pp. 530–534 (2004)
Frisch, A.M., Miguel, I., Walsh, T.: CGRASS: A System for Transforming Constraint Satisfaction Problems. In: O’Sullivan, B. (ed.) CologNet 2002. LNCS (LNAI), vol. 2627, pp. 15–30. Springer, Heidelberg (2003)
The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.4.9 (2006)
Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: Generic SBDD using Computational Group Theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 333–347. Springer, Heidelberg (2003)
Gent, I.P., Smith, B.M.: Symmetry Breaking in Constraint Programming. In: ECAI 2000. 14th European Conference on Artificial Intelligence (2000)
Haselböck, A.: Exploiting Interchangeabilities in Constraint-Satisfaction Problems. In: IJCAI 1993, pp. 282–289 (1993)
Mancini, T., Cadoli, M.: Detecting and Breaking Symmetries by Reasoning on Problem Specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, Springer, Heidelberg (2005)
Mears, C., de la Banda, M.G., Wallace, M.: On Implementing Symmetry Detection. In: SymCon 2006 (2006)
Puget, J.-F.: Symmetry Breaking Revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 446–461. Springer, Heidelberg (2002)
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)
Romani, A., Markov, I.L.: Automatically Exploiting Symmetries in Constraint Programming. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 98–112. Springer, Heidelberg (2004)
Roney-Dougal, C.M., Gent, I.P., Kelsey, T., Linton, S.: Tractable Symmetry Breaking using Restricted Search Trees. In: ECAI 2004 (2004)
Roy, P., Pachet, F.: Using Symmetry of Global Constraints to Speed Up the Resolution of Constraint Satisfaction Problems. In: ECAI 1998 Workshop on Non-binary Constraints, pp. 27–33 (1998)
Sellmann, M., Van Hentenryck, P.: Structural Symmetry Breaking. In: IJCAI 2005 (2005)
Van Hentenryck, P., Flener, P., Pearson, J., Ågren, M.: Compositional Derivation of Symmetries for Constraint Satisfaction. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol. 3607, Springer, Heidelberg (2005)
Walsh, T.: General Symmetry Breaking Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mears, C., Garcia de la Banda, M., Wallace, M., Demoen, B. (2008). A Novel Approach For Detecting Symmetries in CSP Models. In: Perron, L., Trick, M.A. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2008. Lecture Notes in Computer Science, vol 5015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68155-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-68155-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68154-0
Online ISBN: 978-3-540-68155-7
eBook Packages: Computer ScienceComputer Science (R0)