{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:54Z","timestamp":1761621054718},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232124"},{"type":"electronic","value":"9783540302100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30210-0_17","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:34:36Z","timestamp":1295346876000},"page":"199-210","source":"Crossref","is-referenced-by-count":6,"title":["New Developments in Symmetry Breaking in Search Using Computational Group Theory"],"prefix":"10.1007","author":[{"given":"Tom","family":"Kelsey","sequence":"first","affiliation":[]},{"given":"Steve","family":"Linton","sequence":"additional","affiliation":[]},{"given":"Colva","family":"Roney-Dougal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46135-3_7","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A.M. Frisch","year":"2002","unstructured":"Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 93\u2013108. Springer, Heidelberg (2002)"},{"key":"17_CR2","first-page":"73","volume-title":"Proceedings, GP 1999","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Proceedings, GP 1999, pp. 73\u201387. Springer, Heidelberg (1999)"},{"key":"17_CR3","first-page":"599","volume-title":"Proc. ECAI 2000","author":"L.. Gent","year":"2000","unstructured":"Gent, L., Smith, B.M.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) Proc. ECAI 2000, pp. 599\u2013603. IOS Press, Amsterdam (2000)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45578-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45578-7_6","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 77\u201392. Springer, Heidelberg (2001)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-46135-3_28","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I.P. Gent","year":"2002","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.: Groups and constraints: Symmetry breaking during search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 415\u2013430. Springer, Heidelberg (2002)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-45193-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"L.. Gent","year":"2003","unstructured":"Gent, L., Harvey, W., Kelsey, T., Linton, S.A.: Generic SBDD using computational group theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 333\u2013347. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR8","first-page":"159","volume":"12","author":"M.G. Wallace","year":"1997","unstructured":"Wallace, M.G., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal\u00a012(1), 159\u2013200 (1997)","journal-title":"ICL Systems Journal"},{"key":"17_CR9","unstructured":"The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.2 (2000), \n                    \n                      http:\/\/www.gap-system.org"},{"key":"17_CR10","unstructured":"Colva, M., Roney-Dougal, I.P.: Gent, Tom Kelsey, and Steve A. Linton. Tractable symmetry breaking using restricted search trees. In: Proceedings, ECAI 2004 (2004) (to appear)"},{"key":"17_CR11","series-title":"Cambridge tracts in mathematics","volume-title":"Permutation group algorithms","author":"A. Seress","year":"2002","unstructured":"Seress, A.: Permutation group algorithms. Cambridge tracts in mathematics, vol.\u00a0152. Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30210-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:55:57Z","timestamp":1620014157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30210-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232124","9783540302100"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30210-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}