Excluding symmetries in constraint-based search

Constraints

Volumn 7, Issue 3-4, 2002, Pages 333-349

  Backofen, Rolf ^a   Will, Sebastian ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

Constraint based search; Geometric symmetries; Permutation symmetries; Symmetry excluding search (SES); Symmetry exclusion

Indexed keywords

ALGORITHMS; GEOMETRY; MATHEMATICAL TRANSFORMATIONS; MODIFICATION; PROBLEM SOLVING; PROTEINS; SET THEORY;

SYMMETRY EXCLUSION;

CONSTRAINT THEORY;

EID: 0036662847     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020533821509     Document Type: Conference Paper

References (10)

1. Aguirre, A.S.M. (1993). How to use symmetries in boolean constraint solving. In Benhamou, F., & Colmerauer, A., eds., Constraint Logic Programming Selected Research, pages 287-306. The MIT Press.
2. Backofen, R. (1998). Constraint techniques for solving the protein structure prediction problem. In Proceedings of 4th International Conference on Principle and Practice of Constraint Programming (CP'98).
3. Benhamou, B. (1994). Study of symmetry in constraint satisfaction problems. In Borning, A., ed., Principles and Practice of Constraint Programming, Second International Workshop, PPCP'94, Lecture Notes in Computer Science, Vol. 874, Springer-Verlag, Berlin.
4. Benhamou, B., & Sais, L. (1994). Tractability through symmetries in propositional calculus. Journal of Automated Reasoning 12: 89-102.
5. Crawford, J.M., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry breaking predicates for search problems. In Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR'96), pages 149-159.
6. de la Tour, T.B. (1990). Minimizing the number of clauses by renaming. In Stickel, M.E., ed., Proceedings of the loth International Conference on Automated Deduction (CADE90), pages 558-572.
7. Freuder, E. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI'91, pages 227-233.
8. Gent, I., & Smith, B. (2000). Symmetry breaking during search in constraint programming. In Horn, W., ed., Proceedings of ECAI 2000, pages 599-603.
9. Schulte, C., Smolka, G., & Wurtz, J. (1994). Encapsulated search and constraint programming in Oz. In Borning, A., ed., Second Workshop on Principles and Practice of Constraint Programming, Orcas Island, WA, pages 134-150.
10. Smolka, G. (1995). The Oz programming model. In van Leeuwen, J., ed., Computer Science Today, Lecture Notes in Computer Science, Vol. 1000, pages 324-343. Springer-Verlag, Berlin.