The challenge of exploiting weak symmetries

Authors:
Roland Martin
Affiliations:
Algorithmics Group, Darmstadt University of Technology, Darmstadt, Germany
Venue:
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Year:
2005

Citing 3
Cited 1

On the Satisfiability of Symmetrical Constrained Satisfaction Problems

ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
Excluding Symmetries in Constraint-Based Search

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming

A generic method for identifying and exploiting dominance relations

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and the weakly symmetric equivalent solutions preserve the feasibility state only with respect to a subset of the constraints. Therefore, breaking weak symmetries on the whole problem with standard techniques would lead to a loss of solutions. Weak symmetries occur in different application fields like planning, scheduling and manufacturing as well as in the fields of soft constraints. We introduce a technique that enables us to exploit weak symmetries and state experimental results on a real world problem to show the gain in using this technique.