Excluding Symmetries in Constraint-Based Search

Authors:
Rolf Backofen;Sebastian Will
Affiliations:
Institut für Informatik, LMU München, Oettingenstraße 67, D-80538 München backofen@informatik.uni-muenchen.de;Institut für Informatik, LMU München, Oettingenstraße 67, D-80538 München wills@informatik.uni-muenchen.de
Venue:
Constraints
Year:
2002

Citing 3
Cited 4

How to use symmetries in Boolean constraint solving

Constraint logic programming
Encapsulated Search and Constraint Programming in Oz

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Minimizing the Number of Clauses by Renaming

Proceedings of the 10th International Conference on Automated Deduction

A Constraint-Based Approach to Fast and Exact Structure Prediction in Three-Dimensional Protein Models

Constraints
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction

Constraints
Logic Programming Techniques in Protein Structure Determination: Methodologies and Results

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Protein structure prediction on the face centered cubic lattice by local search

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce a new method, called isymmetry excluding search (SES), for excluding symmetries in constraint based search. To our knowledge, it is the first declarative method that can be applied to iarbitrary 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 all symmetries.We proof correctness, completeness and symmetry exclusion properties of our method. Then, we show how to apply the SES-method in the special case of geometric symmetries (rotations and reflections) and permutation symmetries. Furthermore, we give results from practical applications.