{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:11:41Z","timestamp":1783653101230,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540666264","type":"print"},{"value":"9783540480853","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48085-3_6","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T17:25:21Z","timestamp":1292520321000},"page":"73-87","source":"Crossref","is-referenced-by-count":40,"title":["Excluding Symmetries in Constraint-Based Search"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Backofen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Will","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"287","volume-title":"Constraint Logic Programming, Selected Research","author":"A.S.M. Aguirre","year":"1993","unstructured":"Aguirre, A.S.M.: How to use symmetries in boolean constraint solving. In: Benhamou, F., Colmerauer, A. (eds.) Constraint Logic Programming, Selected Research, ch. 16, pp. 287\u2013306. The MIT Press, Cambridge (1993)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-49481-2_7","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"R. Backofen","year":"1998","unstructured":"Backofen, R.: Constraint techniques for solving the protein structure prediction problem. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, p. 72. Springer, Heidelberg (1998)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming","author":"B. Benhamou","year":"1994","unstructured":"Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: Borning, A. (ed.) PPCP 1994. LNCS, vol.\u00a0874. Springer, Heidelberg (1994)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00881844","volume":"12","author":"B. Benhamou","year":"1994","unstructured":"Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. Journal of Automated Reasoning\u00a012, 89\u2013102 (1994)","journal-title":"Journal of Automated Reasoning"},{"key":"6_CR5","unstructured":"Crawford, J.M., Ginsberg, M., Luks, E., Roy, A.: Symmetry breaking predicates for search problems. In: Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 149\u2013159 (1996)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","first-page":"558","volume-title":"10th International Conference on Automated Deduction","author":"T.B. Tour de la","year":"1990","unstructured":"de la Tour, T.B.: Minimizing the number of clauses by renaming. In: Stickel, M.E. (ed.) CADE 1990. LNCS, (LNAI) vol.\u00a0449, pp. 558\u2013572. Springer, Heidelberg (1990)"},{"key":"6_CR7","unstructured":"Eugene Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI\u201991, pages 227\u2013233, 1991."},{"key":"6_CR8","unstructured":"Gent, I.P., Smith, B.: Symmetry breaking during search in constraint programming. Report 99.02. University of Leeds (January 1999)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-58601-6_96","volume-title":"Principles and Practice of Constraint Programming","author":"C. Schulte","year":"1994","unstructured":"Schulte, C., Smolka, G., W\u00fcrtz, J.: Encapsulated search and constraint programming in Oz. In: Borning, A.H. (ed.) PPCP 1994. LNCS, vol.\u00a0874, pp. 134\u2013150. Springer, Heidelberg (1994)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Smolka, G.: The Oz programming model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 324\u2013343. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48085-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T18:06:56Z","timestamp":1547748416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48085-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666264","9783540480853"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48085-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]}}}