Constraints

, Volume 14, Issue 4, pp 443–477 | Cite as

On implementing symmetry detection

Article

Abstract

Automatic symmetry detection has received a significant amount of interest, which has resulted in a large number of proposed methods. This paper reports on our experiences while implementing the approach of Puget (CP2005, LNCS, vol. 3709, pp. 475–489. Springer, 2005). In particular, it proposes a modification to the approach to deal with general expressions, discusses the insights gained, and gives the results of an experimental evaluation of the accuracy and efficiency of the approach.

Keywords

Automatic symmetry detection Graph automorphism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K. R., & Wallace, M. G. (2006). Constraint logic programming using ECLiPSe. Cambridge University Press.Google Scholar
  2. 2.
    Cohen, D., Jeavons, P., Jefferson, C., Petrie, K. E., & Smith, B. M. (2005). Symmetry definitions for constraint satisfaction problems. In P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 17–31). Springer.Google Scholar
  3. 3.
    Crawford, J., Ginsberg, M. L., Luck, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In L. C. Aiello, J. Doyle, S. Shapiro (Eds.), KR’96: Principles of knowledge representation and reasoning (pp. 148–159). San Francisco, CA: Morgan Kaufmann.Google Scholar
  4. 4.
    Darga, P. T., Liffiton, M. H., Sakallah, K. A., & Markov, I. L. (2004). Exploiting structure in symmetry detection for CNF. In S. Malik, L. Fix, A. B. Kahng (Eds.), DAC (pp. 530–534). ACM.Google Scholar
  5. 5.
    Freuder, E. C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proc. AAAI’91 (Vol. 1, pp. 227–233).Google Scholar
  6. 6.
    Frisch, A. M., Miguel, I., & Walsh, T. (2003). CGRASS: A system for transforming constraint satisfaction problems. In B. O’Sullivan (Ed.), Recent advances in constraints, joint ERCIM/CologNet international workshop on constraint solving and constraint logic programming, LNCS (Vol. 2627, pp. 15–30).Google Scholar
  7. 7.
    Gent, I. P., Harvey, W., & Kelsey, T. (2002). Groups and constraints: Symmetry breaking during search. In P. van Hentenryck (Ed.), CP2002, LNCS (Vol. 2470, pp. 415–430). Springer.Google Scholar
  8. 8.
    Gent, I. P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. Technical report, Technical report APES-09-1999. A shorter version appears in the proceedings of the 5th international conference on principles and practices of constraint programming (CP-99). Available from http://www.csplib.org/.
  9. 9.
    Jégou, P. (1993). Decomposition of domains based on the micro-structure of finite constraint satisfaction problems. In AAAI93: Proceedings of the 11th national conference on artificial intelligence (pp. 731–736).Google Scholar
  10. 10.
    McKay, B. D. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45–87.MathSciNetGoogle Scholar
  11. 11.
    Pearson, J., van Hentenryck, P., Flener, P., & Ȧgren, M. (2005). Compositional derivation of symmetries for constraint satisfaction. In Proceedings of the international symposium on abstraction, reformulation, and approximation (SARA’05).Google Scholar
  12. 12.
    Puget, J.-F. (2002). Symmetry breaking revisited. In P. Van Hentenryck (Ed.), CP2002, LNCS (Vol. 2470, pp. 446–461). Springer.Google Scholar
  13. 13.
    Puget, J.-F. (2005). Automatic detection of variable and value symmetries. P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 475–489). Springer.Google Scholar
  14. 14.
    Puget, J.-F. (2005). Breaking all value symmetries in surjection problems. In P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 490–504). Springer.Google Scholar
  15. 15.
    Ramani, A., & Markov, I. L. (2004). Automatically exploiting symmetries in constraint programming. In B. Faltings, A. Petcu, F. Fages, F. Rossi (Eds.), CSCLP (Vol. 3419, pp. 98–112).Google Scholar
  16. 16.
    Roy, P., & Pachet, F. (1998). Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In ECAI98 workshop on non-binary constraints (pp. 27–33).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Clayton School of ITMonash UniversityMelbourneAustralia

Personalised recommendations