Excluding symmetries in constraint-based search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1713, Issue , 1999, Pages 73-87

  Backofen, Rolf ^a   Will, Sebastian ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

ARBITRARY SYMMETRY; CONSTRAINT-BASED; GENERAL CONSTRAINTS; GEOMETRIC SYMMETRY; PERMUTATION SYMMETRY; SEARCH ALGORITHMS; SEARCH STRATEGIES; SYMMETRIC CONSTRAINTS;

COMPUTER PROGRAMMING;

EID: 84957363249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_6     Document Type: Conference Paper

References (10)

1. Alfonso San, Miguel Aguirre. How to use symmetries in boolean constraint solving. In Frdric Benhamou and Alain Colmerauer, editors, Constraint Logic Programming, Selected Research, chapter 16, pages 287–306. The MIT Press, 1993.
2. Rolf Backofen. Constraint techniques for solving the protein structure prediction problem. In Proceedings of 4th International Conference on Principle and Practive of Constraint Programming (CP’98), 1998.
3. Belaid Benhamou. Study of symmetry in constraint satisfaction problems. In Alan Borning, editor, Principles and Practice of Constraint Programming, Second International Workshop, PPCP’94,, volume 874 of Lecture Notes in Computer Science. Springer, 1994.
4. Belaid Benhamou and Lakhdar Sais. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12:89–102, 1994.
5. James M. Crawford, Matthew Ginsberg, Eugene Luks, and Amitabha Roy. Symmetry breaking predicates for search problems. In Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR’96), pages 149–159, 1996.
6. Thierry Boy de la Tour. Minimizing the number of clauses by renaming. In M. E. Stickel, editor, Proc. of the 10th Int. Conf. on Automated Deduction (CADE90), number 449 in LNAI, pages 558–572. Springer, 1990.
7. Eugene Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI’91, pages 227–233, 1991.
8. Ian P. Gent and Barbara Smith. Symmetry breaking during search in constraint programming. Report 99.02, University of Leeds, January 1999.
9. Christian Schulte, Gert Smolka, and Jörg Würtz. Encapsulated search and constraint programming in Oz. In A.H. Borning, editor, Second Workshop on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 874, pages 134–150, Orcas Island, Washington, USA, May 1994. Springer- Verlag.
10. Gert Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324–343. Springer-Verlag, Berlin, 1995.