Groups and constraints: Symmetry breaking during search

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

Volumn 2470, Issue , 2002, Pages 415-430

  Gent, Ian P ^a   Harvey, Warwick ^b   Kelsey, Tom ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; LOGIC PROGRAMMING;

ABSTRACT ALGEBRA; CONSTRAINT LOGIC PROGRAMMING; SEARCH PERFORMANCE; SYMMETRIC CONSTRAINTS; SYMMETRY-BREAKING;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957038221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_28     Document Type: Conference Paper

References (14)

1. R. Backofen and S. Will, Excluding symmetries in constraint-based search, P roceedings, CP-99, Springer, 1999, LNCS 1713, pp. 73–87.
2. J.C. Beck, P. Prosser, and E. Selensky, On the reformulation of vehicle routing problems and scheduling problems, Tech. Report APES-44-2002, APES Research Group, February 2002.
3. C.A. Brown, L. Finkelstein, and P.W. Purdom, Jr., Backtrack searching in the presence of symmetry, Proc. AAECC-6 (T. Mora, ed.), no. 357, Springer-Verlag, 1988, pp. 99–110.
4. M. Calder and A. Miller, Five ways to use induction and symmetry in the verification of networks of processes by model-checking, Proc. AVoCS, 2002, pp. 29–42.
5. C.H. Colbourn and J. H. Dinitz eds., The CRC handbook of combinatorial designs, CRC Press, Rockville, Maryland, USA, 1996.
6. J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry breaking predicates for search problems, Proc. KR 96, Morgan Kaufmann, 1996, pp. 148–159.
7. T. Fahle, S. Schamberger, and M. Sellmann, Symmetry breaking, Proc. CP 2001 (T. Walsh, ed.), 2001, pp. 93–107.
8. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh, Symmetry in matrix models, Tech. Report APES-30-2001, APES Research Group, October 2001.
9. F. Focacci and M. Milano, Global cut framework for removing symmetries, P roc. CP2001 (T. Walsh, ed.), 2001, pp. 77–92.
10. The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.2, 2000, http://www.gap-system.org.
11. I. P. Gent, S. A. Linton, and B.M. Smith, Symmetry breaking in the alien tiles puzzle, Tech. Report APES-22-2000, APES Research Group, October 2000.
12. I. P. Gent and B.M. Smith, Symmetry breaking in constraint programming, Proceedings of ECAI-2000 (W. Horn, ed.), IOS Press, 2000, pp. 599–603.
13. I. McDonald, Unique symmetry breaking in CSPs using group theory, Proc. Sym- Con’01 (P. Flener and J. Pearson, eds.), 2001, pp. 75–78.
14. M. G. Wallace, S. Novello, and J. Schimpf, ECLiPSe: A platform for constraint logic programming, ICL Systems Journal 12 (1997), no. 1, 159–200.