{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:23Z","timestamp":1760707823214},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_28","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"415-430","source":"Crossref","is-referenced-by-count":35,"title":["Groups and Constraints: Symmetry Breaking during Search"],"prefix":"10.1007","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warwick","family":"Harvey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Kelsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"28_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-48085-3_6","volume-title":"Proceedings, CP-99","author":"R. Backofen","year":"1999","unstructured":"R. Backofen and S. Will, Excluding symmetries in constraint-based search, Proceedings, CP-99, Springer, 1999, LNCS 1713, pp. 73\u201387."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-45622-8_21"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013110.","DOI":"10.1007\/3-540-51083-4_51"},{"key":"28_CR4","unstructured":"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\u201342."},{"volume-title":"The CRC handbook of combinatorial designs","year":"1996","key":"28_CR5","unstructured":"C. H. Colbourn and J. H. Dinitz (eds.), The CRC handbook of combinatorial designs, CRC Press, Rockville, Maryland, USA, 1996."},{"key":"28_CR6","unstructured":"J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry breaking predicates for search problems, Proc. KR 96, Morgan Kaufmann, 1996, pp. 148\u2013159."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"T. Fahle, S. Schamberger, and M. Sellmann, Symmetry breaking, Proc. CP 2001 (T. Walsh, ed.), 2001, pp. 93\u2013107.","DOI":"10.1007\/3-540-45578-7_7"},{"key":"28_CR8","unstructured":"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."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"F. Focacci and M. Milano, Global cut framework for removing symmetries, Proc. CP 2001 (T. Walsh, ed.), 2001, pp. 77\u201392.","DOI":"10.1007\/3-540-45578-7_6"},{"key":"28_CR10","unstructured":"The GAP Group, GAP-Groups, Algorithms, and Programming, Version 4.2, 2000, http:\/\/www.gap-system.org ."},{"key":"28_CR11","unstructured":"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."},{"key":"28_CR12","unstructured":"I. P. Gent and B. M. Smith, Symmetry breaking in constraint programming, Proceedings of ECAI-2000 (W. Horn, ed.), IOS Press, 2000, pp. 599\u2013603."},{"key":"28_CR13","unstructured":"I. McDonald, Unique symmetry breaking in CSPs using group theory, Proc. Sym-Con\u201901 (P. Flener and J. Pearson, eds.), 2001, pp. 75\u201378."},{"issue":"1","key":"28_CR14","first-page":"159","volume":"12","author":"M. G. Wallace","year":"1997","unstructured":"M. G. Wallace, S. Novello, and J. Schimpf, ECLiPSe: A platform for constraint logic programming, ICL Systems Journal 12 (1997), no. 1, 159\u2013200.","journal-title":"ICL Systems Journal"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:29Z","timestamp":1556396729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}