Groups and Constraints: Symmetry Breaking during Search

  • Authors:
  • Ian P. Gent;Warwick Harvey;Tom Kelsey

  • Affiliations:
  • -;-;-

  • Venue:
  • CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.05

Visualization

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.