Optimum Symmetry Breaking in CSPs Using Group Theory

  title={Optimum Symmetry Breaking in CSPs Using Group Theory},
  author={Iain McDonald},
There has been a lot of interest in breaking symmetries in CSPs over the past ten years. The research carried out has detailed how to exploit the symmetries in CSPs so that we only search for unique solutions i.e. we will count two symmetrically equivalent solutions as one solution. In doing so we hope to take less time finding solutions. 

Partial Symmetry Breaking

This paper is the first systematic study of partial symmetry breaking in constraint programming, and shows experimentally that performing symmetry breaking with only a subset of all symmetries can result in greatly reduced run-times.

Lightweight dynamic symmetry breaking

Lightweight Dynamic Symmetry Breaking is presented, an automatic symmetry breaking method that is efficient enough to be used as a default, since it never yields a major slowdown while often giving major performance improvements.

Groups and Constraints: Symmetry Breaking during Search

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



Symmetry Breaking in Constraint Programming

This work describes a method for symmetry breaking during search (SBDS) in constraint programming that guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and value ordering heuristics.

Symmetry Breaking in the Alien Tiles Puzzle

This is the first integration of an algebraic system like GAP and a constraint programming system like ILOG Solver, based on the Alien Tiles game, and a 40-fold run-time provement over code with no symmetry breaking is obtained.

Eliminating Interchangeable Values in Constraint Satisfaction Problems

A concept of interchangeability of CSP values is developed that permits recognition of some interchangeable values with polynomial time local computation and several forms of weak interchangeability are defined that permit eliminating values without losing all solutions.

Symmetry-breaking predi ates for sear h problems. In Knowledge Representa tion'96: Prin iples of Knowledge Representation and Reasoning, pages 148{159

  • 1996

Redu ing symmetry in a ombinatorial design problem

  • Te hni al Report Resear h Report 2001.01,
  • 2001

Study of symmetry in onstraint satisfa tion problems

  • Prin iples and Pra ti e of Constraint
  • 1994

Ex luding symmetries in onstraint-based sear h

  • Prin iples and Pra ti e of Constraint Programming,
  • 1999