@inproceedings{Bac:Wil:CP99,
author = {Backofen, Rolf and Will, Sebastian},
title = {Excluding Symmetries in Constraint-Based Search},
booktitle = {Proceedings of 5th International Conference on
             Principle and Practice of Constraint Programming (CP'99)},
year = {1999},
doi = {https://link.springer.com/chapter/10.1007/978-3-540-48085-3_6},
volume = {1713},
user = {will},
series = {Lecture Notes in Computer Science},
publisher = {Springer--Verlag},
pages = {73-87},
editor = {Joxan Jaffar},
address = {Berlin},
abstract = {
            We introduce a new method for excluding symmetries in
            constraint based search. To our knowledge, it is the
            first declarative method that can be applied to {\em
            arbitrary} symmetries. Our 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 with an subset of all
            symmetries.
            
            We proof correctness, completeness and symmetry
            exclusion properties of our method. We then show how
            to apply the method in the special case of geometric
            symmetries (rotations and reflections) and
            permutation symmetries. Furthermore, we give results
            from practical applications.}
}