Symmetry Breaking Revisited

@article{Puget2004SymmetryBR,
  title={Symmetry Breaking Revisited},
  author={Jean-François Puget},
  journal={Constraints},
  year={2004},
  volume={10},
  pages={23-46}
}
  • J. Puget
  • Published 9 September 2002
  • Computer Science
  • Constraints
Symmetries in constraint satisfaction problems (CSPs) are one of the difficulties that practitioners have to deal with. We present in this paper a new method based on the symmetries of decisions taken from the root of the search tree. This method can be seen as an improvement of the SBDD method presented by Focacci and Milano [7] and Fahle, Schamberger and Sellmann [5]. We present a simple formalization of our method for which we prove correctness and completeness results. We show that our… 

Local Symmetry Breaking During Search in CSPs

TLDR
A general principle of semantic symmetry is studied and a syntactic symmetry is defined which is a sufficient condition for semantic symmetry, and it is shown how to detect and how to eliminate it locally to increase CSP tree search methods efficiency.

Breaking Symmetry in Injective Problems

TLDR
It is shown how this partial ordering of the variables can be automatically computed using computational group theory (CGT) and further shown that partial orders can be safely used together with the GE-tree method.

Symmetry Breaking Using Stabilizers

TLDR
STAB is a method that adds some symmetry breaking constraints during the search for solution to matrix problems where rows and columns can be permuted and is more than one order of magnitude more efficient than best published techniques so far.

Symmetry Breaking in Soft CSPs

TLDR
It is demonstrated that breaking symmetries in soft constraint satisfaction problems improves the efficiency of search and contributes to the state-of-the-art in symmetry breaking, as well as in reasoning about preferences.

Structural symmetry breaking for constraint satisfaction problems

TLDR
Several classes of CSPs are identified that encompass many practical problems and for which symmetry breaking for various forms of value or variable interchangeability is tractable using dedicated search procedures, and the limits of efficient symmetry breaking are shown.

Combining Branch&Bound and SBDD to solve Soft CSPs

TLDR
Soft-SBDD, a generalization of Symmetry Breaking via Dominance Detection, is presented, and theoretical results demonstrating that symmetry breaking in soft constraint satisfaction problems improves the efficiency of search are presented.

Partial symmetry breaking by local search in the group

TLDR
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.

Dynamic structural symmetry breaking for constraint satisfaction problems

TLDR
Several classes of CSPs are identified that encompass many practical problems and for which symmetry breaking for various forms of value or variable interchangeability is tractable using dedicated search procedures, and the limits of efficient symmetry breaking are shown.

Dynamic Detection and Elimination of Local Symmetry in CSPs

TLDR
A general principle of semantic symmetry is studied and a weakened form of this syntactic symmetry is defined which is a sufficient condition for semantic symmetry, and three local symmetry detection and elimination strategies are studied and compared to global symmetry elimination.

Symmetry Breaking by Local Search ⋆

TLDR
A new approach to symmetry breaking is described: using local search in the symmetry group to detect violated lex-leader constraints, which opens up a fruitful new connection between the fields of symme try breaking and metaheuristics.
...

References

SHOWING 1-10 OF 25 REFERENCES

Symmetry breaking during search in constraint programming

TLDR
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 by the variable and value ordering heuristics.

Symmetry Breaking Using Stabilizers

TLDR
STAB is a method that adds some symmetry breaking constraints during the search for solution to matrix problems where rows and columns can be permuted and is more than one order of magnitude more efficient than best published techniques so far.

Symmetry Breaking in Constraint Programming

TLDR
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

TLDR
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.

Excluding Symmetries in Constraint-Based Search

TLDR
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.

Global Cut Framework for Removing Symmetries

TLDR
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.

On the Satisfiability of Symmetrical Constrained Satisfaction Problems

TLDR
A general solution for symmetrical constraint satisfaction problems is described and both a theoretical study and experimental results using the constraint-based library PECOS are provided.

Tractable Symmetry Breaking for CSPs with Interchangeable Values

TLDR
This paper identifies several CSP classes which feature various forms of value interchangeability and shows that symmetry breaking can be performed in constant time and space during search using dedicated search procedures.

Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems

TLDR
This paper addresses the problem of detecting and exploiting a particular class of symmetry called intensional permutability, which is based on the notion of interchangeability between variables and can be detected with a very small overhead, and proposes a simple method to exploit it.

Partial Symmetry Breaking

TLDR
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.