Groups and Constraints: Symmetry Breaking during Search

  title={Groups and Constraints: Symmetry Breaking during Search},
  author={Ian P. Gent and Warwick Harvey and Tom Kelsey},
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… 

Tractable Symmetry Breaking Using Restricted Search Trees

A new conceptual abstraction in symmetry breaking - the GE-tree is presented, and a polynomial-time algorithm for this construction in the case of CSPs with arbitrary value symmetries is given.

Comparison of Symmetry Breaking Methods

Constraint satisfaction problems (CSPs) are often highly symmetric, so constraint programmers use symmetry breaking methods to exclude all but one in each equivalence class of solutions.

New Developments in Symmetry Breaking in Search Using Computational Group Theory

This paper analyzes the structure of symmetry groups of constraint satisfaction problems, and implements several combinations of GE-trees and the classical SBDD method for breaking all symmetries.

Constraint Symmetry and Solution Symmetry

This work discusses how solution symmetry and constraint symmetry are related and shows that some CSP instances have many more solution symmetries than constraint symmetry.

Symmetry Breaking in Numeric Constraint Problems

It is shown that, for the variable symmetries among those proposed, the proposed inequalities are but a specific case of a relaxation of the well-known LEX constraints extensively used for discrete CSPs.

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.

Partial symmetry breaking by local search in the group

A new method called Symmetry Breaking by Nonstationary Optimisation is described, which interleaves local search in the symmetry group with backtrack search on the constraint problem, which can be tuned to break each symmetry with an arbitrarily high probability with high runtime overhead.

Symmetry Breaking Revisited

This paper presents a new method based on the symmetries of decisions taken from the root of the search tree that is theoretically more efficient as the size of each no-good is smaller and can be seen as an improvement of the SBDD method.

Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE

This work presents a systematic method by which the automated constraint modelling tool CONJURE can break conditional symmetry as it enters a model during refinement, and results in the automatic and complete removal of model symmetry for the entire problem class represented by the input specification.

NuSBDS: An Easy to Use Symmetry Breaking System

The GHK-SBDS method of breaking symmetry requires the user to supply a generator set of a group representing the symmetries of the CSP.



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 Predicates for Search Problems

This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates.

Symmetry Breaking

This work presents an approach that detects symmetric choice points during the search and enables the user to find solutions for complex problems with minimal effort spent on modeling.

Optimum Symmetry Breaking in CSPs Using Group Theory

The research carried out has detailed how to exploit the symmetries in CSPs so that it will take less time to find unique solutions i.e. the authors will count two symmetrically equivalent solutions as one solution.

Excluding Symmetries in Constraint-Based Search

This work introduces a new method, called symmetry excluding search (SES), for excluding symmetries in constraint based search, which is the first declarative method that can be applied to arbitrary asymmetries, and proves correctness, completeness and symmetry exclusion properties.

Symmetry in matrix models

This work study and generalise symmetry-breaking techniques, such as lexicographic ordering, and proposes a labelling technique achieving the same effect.

Backtrack Searching in the Presence of Symmetry

This paper gives the first algorithm that combines search rearrangement with an arbitrary symmetry group, and it is confirmed that the algorithms save a considerable amount of time on symmetric search problems.

Global Cut Framework for Removing Symmetries

A general technique for removing symmetries in CSPs during search to record no-goods, during the exploration of the search tree, whose symmetric counterpart should be removed, and presents a general, correct and complete filtering algorithm for SRCs.

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.

On the Reformulation of Vehicle Routing Problems and Scheduling Problems

This paper presents a pre-processing transformation that "compresses" the VRP, transforming an element of travel into the duration of the visits, and reformulated as scheduling problem, to determine if it is primarily distance in theVRP that causes scheduling technology to degrade on the reformulated problem.