Groups and Constraints: Symmetry Breaking during Search

  • Ian P. Gent
  • Warwick Harvey
  • Tom Kelsey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2470)

Abstract

We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. The interface provides a method for efficiently dealing with large numbers of symmetries of constraint satisfaction problems for minimal programming effort. We also report an implementation of SBDS using the GAP-ECLiPSe interface which is capable of handling many more symmetries than previous implementations and provides improved search performance for symmetric constraint satisfaction problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Backofen and S. Will, Excluding symmetries in constraint-based search, Proceedings, CP-99, Springer, 1999, LNCS 1713, pp. 73–87.Google Scholar
  2. [2]
    J. C. Beck, P. Prosser, and E. Selensky, On the reformulation of vehicle routing problems and scheduling problems, Tech. Report APES-44-2002, APES Research Group, February 2002.Google Scholar
  3. [3]
    C.A. Brown, L. Finkelstein, and P. W. Purdom, Jr., Backtrack searching in the presence of symmetry, Proc. AAECC-6 (T. Mora, ed.), no. 357, Springer-Verlag, 1988, pp. 99–110.Google Scholar
  4. [4]
    M. Calder and A. Miller, Five ways to use induction and symmetry in the verification of networks of processes by model-checking, Proc. AVoCS, 2002, pp. 29–42.Google Scholar
  5. [5]
    C. H. Colbourn and J. H. Dinitz (eds.), The CRC handbook of combinatorial designs, CRC Press, Rockville, Maryland, USA, 1996.MATHGoogle Scholar
  6. [6]
    J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry breaking predicates for search problems, Proc. KR 96, Morgan Kaufmann, 1996, pp. 148–159.Google Scholar
  7. [7]
    T. Fahle, S. Schamberger, and M. Sellmann, Symmetry breaking, Proc. CP 2001 (T. Walsh, ed.), 2001, pp. 93–107.Google Scholar
  8. [8]
    P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh, Symmetry in matrix models, Tech. Report APES-30-2001, APES Research Group, October 2001.Google Scholar
  9. [9]
    F. Focacci and M. Milano, Global cut framework for removing symmetries, Proc. CP 2001 (T. Walsh, ed.), 2001, pp. 77–92.Google Scholar
  10. [10]
    The GAP Group, GAP-Groups, Algorithms, and Programming, Version 4.2, 2000, http://www.gap-system.org.
  11. [11]
    I.P. Gent, S.A. Linton, and B.M. Smith, Symmetry breaking in the alien tiles puzzle, Tech. Report APES-22-2000, APES Research Group, October 2000.Google Scholar
  12. [12]
    I. P. Gent and B. M. Smith, Symmetry breaking in constraint programming, Proceedings of ECAI-2000 (W. Horn, ed.), IOS Press, 2000, pp. 599–603.Google Scholar
  13. [13]
    I. McDonald, Unique symmetry breaking in CSPs using group theory, Proc. Sym-Con’01 (P. Flener and J. Pearson, eds.), 2001, pp. 75–78.Google Scholar
  14. [14]
    M. G. Wallace, S. Novello, and J. Schimpf, ECLiPSe: A platform for constraint logic programming, ICL Systems Journal 12 (1997), no. 1, 159–200.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ian P. Gent
    • 1
  • Warwick Harvey
    • 2
  • Tom Kelsey
    • 1
  1. 1.School of Computer ScienceUniversity of St AndrewsFifeUK
  2. 2.IC-Parc Imperial CollegeLondonUK

Personalised recommendations