{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:27Z","timestamp":1725564927672},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_23","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T23:35:03Z","timestamp":1283988903000},"page":"333-347","source":"Crossref","is-referenced-by-count":31,"title":["Generic SBDD Using Computational Group Theory"],"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"}]},{"given":"Steve","family":"Linton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-48085-3_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 73\u201387. Springer, Heidelberg (1999)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","first-page":"99","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"C.A. Brown","year":"1988","unstructured":"Brown, C.A., Finkelstein, L., Purdom Jr., P.W.: Backtrack searching in the presence of symmetry. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 99\u2013110. Springer, Heidelberg (1988)"},{"issue":"3","key":"23_CR3","first-page":"203","volume":"3","author":"C.A. Brown","year":"1996","unstructured":"Brown, C.A., Finkelstein, L., Purdom Jr., P.W.: Backtrack searching in the presence of symmetry. Nordic Journal of Computing\u00a03(3), 203\u2013219 (1996)","journal-title":"Nordic Journal of Computing"},{"volume-title":"The CRC handbook of combinatorial designs","year":"1996","key":"23_CR4","unstructured":"Colbourn, C.H., Dinitz, J.H. (eds.): The CRC handbook of combinatorial designs. CRC Press, Rockville (1996)"},{"key":"23_CR5","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":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P. Flener","year":"2002","unstructured":"Flener, P., Frisch, A.M., Hnich, B., K\u0131z\u0131ltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 462\u2013476. Springer, Heidelberg (2002)"},{"key":"23_CR7","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":"23_CR8","unstructured":"The GAP Group. GAP \u2013 Groups, Algorithms, and Programming, Version 4.2 (2000), http:\/\/www.gap-system.org"},{"key":"23_CR9","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":"23_CR10","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Harvey, W., Kelsey, T., Linton, S.: Generic SBDD using computational group theory, Tech. Report APES-57a-2003, APES Research Group (January 2003), available from http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html","DOI":"10.1007\/978-3-540-45193-8_23"},{"key":"23_CR11","first-page":"599","volume-title":"Proceedings of ECAI 2000","author":"I.P. Gent","year":"2000","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) Proceedings of ECAI 2000, pp. 599\u2013603. IOS Press, Amsterdam (2000)"},{"key":"23_CR12","unstructured":"Harvey, W.: Symmetry breaking and the social golfer problem. In: Flener, P., Pearson, J. (eds.) Proceedings, SymCon 2001: Symmetry in Constraints, pp. 9\u201316 (2001)"},{"key":"23_CR13","unstructured":"Harvey, W., Kelsey, T., Petrie, K.: Symmetry group generation for CSPs, Tech. Report APES-60-2003, APES Research Group (July 2003), available from http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html"},{"key":"23_CR14","series-title":"Logic Programming Series","volume-title":"Constraint satisfaction in logic programming","author":"P. Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P.: Constraint satisfaction in logic programming. Logic Programming Series. MIT Press, Cambridge (1989)"},{"key":"23_CR15","unstructured":"McDonald, I.: Symmetry breaking systems, Tech. Report APES-61-2003, APES Research Group (July 2003), available from http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-46135-3_29","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I. McDonald","year":"2002","unstructured":"McDonald, I., Smith, B.: Partial symmetry breaking. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 431\u2013445. Springer, Heidelberg (2002)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/3-540-46135-3_30","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"J.-F. Puget","year":"2002","unstructured":"Puget, J.-F.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 446\u2013461. Springer, Heidelberg (2002)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/3-540-46135-3_30","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"J.-F. Puget","year":"2002","unstructured":"Puget, J.-F.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 446\u2013461. Springer, Heidelberg (2002)"},{"key":"23_CR19","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)"},{"issue":"1","key":"23_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T07:30:08Z","timestamp":1559633408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}