Excluding Symmetries in Constraint-Based Search

  title={Excluding Symmetries in Constraint-Based Search},
  author={Rolf Backofen and Sebastian A. Will},
We introduce a new method, called symmetry excluding search (SES), for excluding symmetries in constraint based search. To our knowledge, it is the first declarative method that can be applied to arbitrary symmetries. The SES-method is based on the notion of symmetric constraints, which are used in our modification of a general constraint based search algorithm. The method does not influence the search strategy. Furthermore, it can be used with either the full set of symmetries, or a subset of… 

Breaking Constraints Dynamically

This approach inherits good properties of both dynamic and static symmetry breaking methods: it can have fast propagation on the posted symmetry breaking constraints without conflicting with the branching heuristic, and it proves that its method is correct and only eliminates symmetric solutions.

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.

Symmetry Breaking in Constraint Satisfaction Problems

Two methods performing Symmetry Breaking During Search (SBDS) are presented, and a combination of two systems, ECLPSand GAP, is used, which results in formalizing the use of symmetries, making the separation between the search procedure and symmetry breaking more clear.

Symmetry Definitions for Constraint Satisfaction Problems

The many different definitions of symmetry for constraint satisfaction problems (CSPs) are reviewed, and it is shown that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as anoperation preserving the constraints.

Symmetry Breaking Using Stabilizers

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.

Local Symmetry Breaking During Search in CSPs

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.

Compositional Derivation of Symmetries for Constraint Satisfaction

A compositional approach which derives symmetries of the applications from primitive constraints is proposed, recognition of the special role of global constraints in symmetry detection.

GAPLex: Generalized Static Symmetry Breaking

This work describes a novel algorithm that statically breaks symmetry in CSPs by using computational group theory during search, and believes this to be the first method that successfully combines the posting of symmetry breaking constraints before search, with symmetry breaking by analysis of search states.

Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

This paper introduces value precedence, a notion which can be used to break a common class of value symmetries, namely asymmetries of indistinguishable values, and proposes efficient propagation algorithms for implementing global value precedence constraints.

Symmetries, almost symmetries, and lazy clause generation

This paper shows how to successfully combine Symmetry Breaking During Search and Lazy Clause Generation to create a new symmetry breaking method which is called SBDS-1UIP, which can be modified to exploit almost symmetries very effectively.



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 during search in constraint programming

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.

Study of symmetry in Constraint Satisfaction Problems

The principle of symmetry is given and it is shown that the concept of interchangeability introduced by Freuder, is a particular case of symmetry, which can be used by existing constraint propagation algorithms exploiting symmetries.

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.

Tractability through symmetries in propositional calculus

This work proves for the first time the unsatisfiability of Ramsey's problem (17 vertices and three colors) which has been the subject of much research.

Constraint Techniques for Solving the Protein Structure Prediction Problem

A constraint formulation of the HP-model structure prediction problem is described, a novel, general technique for excluding geometrical symmetries in constraint programming is introduced and a new lower bound on the energy of an HP-protein is described.

Minimizing the Number of Clauses by Renaming

A translation is obtained which is shown to be polynomial in size, and optimal in number of clauses when the theorem contains no equivalence, and shows that this translation is not necessarily optimal in presence of equivalence.

Encapsulated Search and Constraint Programming in Oz

This paper focuses on the most recent extension of Oz, a higher-order combinator providing for encapsulated search, and discusses the semantics of integer and finite domain constraints in a deep guard computation model.

The Oz Programming Model

  • G. Smolka
  • Computer Science
    Computer Science Today
  • 1995
The Oz Programming Model is a concurrent programming model subsuming higher-order functional and object-oriented programming as facets of a general model and can be extended so that it can express encapsulated problem solvers generalizing the problem solving capabilities of constraint logic programming.

How to Use Symmetries in Boolean Constraint Solving

L'objectif de ce travail est d'accroitre l'efficacite des demonstrateurs de theoremes grace a l'utilisation des symetries avec la facon d'obtenir des demonstrations courtes si l'on utilise la resolution augmentee de ce principe.