New Developments in Symmetry Breaking in Search Using Computational Group Theory

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

Volumn 3249, Issue , 2004, Pages 199-210

  Kelsey, Tom ^a   Linton, Steve ^a   Roney Dougal, Colva ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; FORESTRY; GROUP THEORY; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL GROUP THEORY; EXPERIMENTAL EVIDENCE; LOW DEGREE; POLYNOMIAL TIME METHODS; STRONG INTERACTION; SYMBOLIC COMPUTATION; SYMMETRY GROUPS; SYMMETRY-BREAKING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048881125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_17     Document Type: Article

References (11)

1. A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh. Global constraints for lexicographic orderings. In P. van Hentenryck, editor, Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, volume 2470 of Lecture Notes in Computer Science, pages 93-108. Springer, 2002.
2. R. Backofen and S. Will. Excluding symmetries in constraint-based search. In Proceedings, CP-99, pages 73-87. Springer, 1999.
3. I.P. Gent and B.M. Smith. Symmetry breaking in constraint programming. In W. Horn, editor, Proc. EGAI2000, pages 599-603. IOS Press, 2000.
4. Torsten Fahle, Stefan Schamberger, and Meinolf Selhnann. Symmetry breaking. In T. Walsh, editor, Proc. CP 2001, pages 93-107, 2001.
5. Filippo Focacci and Michaela Milano. Global cut framework for removing symmetries. In T. Walsh, editor, Proc. CP 2001, pages 77-92, 2001.
6. lan P. Gent, Warwick Harvey, and Ibm Kelsey. Groups and constraints: Symmetry breaking during search. In Pascal Van Hentenryck, editor, Proc. CP 2002, pages 415-430. Springer-Verlag, 2002.
7. I.P. Gent, W. Harvey, T. Kelsey, and S.A. Linton. Generic SBDD using computational group theory. In Francesca Rossi, editor, Proc. CP 2003, pages 333-347. Springer-Verlag, 2003.
8. M. G. Wallace, S. Novelle, and J. Schimpf. ECLiPSe : A platform for constraint logic programming. IGL Systems Journal, 12(1):159-200, May 1997.
9. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4-2, 2000. (http://www.gap-system.org).
10. Colva M. Roney-Dougal, lan P. Gent, Tom Kelsey, and Steve A. Linton. Tractable symmetry breaking using restricted search trees. In Proceedings, ECAI-04, 2004. To appear.
11. Akos Seress. Permutation group algorithms. Number 152 in Cambridge tracts in mathematics. Cambridge University Press, 2002.