{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:28:44Z","timestamp":1791268124184,"version":"4.1.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1020533821509","type":"journal-article","created":{"date-parts":[[2003,3,18]],"date-time":"2003-03-18T15:12:43Z","timestamp":1048000363000},"page":"333-349","source":"Crossref","is-referenced-by-count":16,"title":["Excluding Symmetries in Constraint-Based Search"],"prefix":"10.1007","volume":"7","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":"5095786_CR1","unstructured":"Aguirre, A. S. M. (1993). How to use symmetries in boolean constraint solving. In Benhamou, F., & Colmerauer, A., eds., Constraint Logic Programming Selected Research, pages 287\u2013306. The MIT Press."},{"key":"5095786_CR2","doi-asserted-by":"crossref","unstructured":"Backofen, R. (1998). Constraint techniques for solving the protein structure prediction problem. In Proceedings of 4th International Conference on Principle and Practice of Constraint Programming (CP'98).","DOI":"10.1007\/3-540-49481-2_7"},{"key":"5095786_CR3","volume-title":"Principles and Practice of Constraint Programming, Second International Workshop, PPCP'94","author":"B. Benhamou","year":"1994","unstructured":"Benhamou, B. (1994). Study ofsymmetry in constraint satisfaction problems. In Borning, A., ed., Principles and Practice of Constraint Programming, Second International Workshop, PPCP'94, Lecture Notes in Computer Science, Vol. 874, Springer-Verlag, Berlin."},{"key":"5095786_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00881844","volume":"12","author":"B. Benhamou","year":"1994","unstructured":"Benhamou, B., & Sais, L. (1994). Tractability through symmetries in propositional calculus. Journal of Automated Reasoning 12: 89\u2013102.","journal-title":"Journal of Automated Reasoning"},{"key":"5095786_CR5","unstructured":"Crawford, J. M., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry breaking predicates for search problems. In Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR'96), pages 149\u2013159."},{"key":"5095786_CR6","doi-asserted-by":"crossref","unstructured":"de la Tour, T. B. (1990). Minimizing the number ofclauses by renaming. In Stickel, M. E., ed., Proceedings of the 10th International Conference on Automated Deduction (CADE90), pages 558\u2013572.","DOI":"10.1007\/3-540-52885-7_114"},{"key":"5095786_CR7","unstructured":"Freuder, E. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of AAAI'91, pages 227\u2013233."},{"key":"5095786_CR8","unstructured":"Gent, I., & Smith, B. (2000). Symmetry breaking during search in constraint programming. In Horn, W., ed., Proceedings of ECAI 2000, pages 599\u2013603."},{"key":"5095786_CR9","doi-asserted-by":"crossref","unstructured":"Schulte, C., Smolka, G., & Wurtz, J. (1994). Encapsulated search and constraint programming in Oz. In Borning, A., ed., Second Workshop on Principles and Practice of Constraint Programming, Orcas Island, WA, pages 134\u2013150.","DOI":"10.1007\/3-540-58601-6_96"},{"key":"5095786_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Smolka, G. (1995). The Oz programming model. In van Leeuwen, J., ed., Computer Science Today, Lecture Notes in Computer Science, Vol. 1000, pages 324\u2013343. Springer-Verlag, Berlin."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020533821509.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020533821509\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020533821509.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:48:17Z","timestamp":1752378497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020533821509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":10,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["5095786"],"URL":"https:\/\/doi.org\/10.1023\/a:1020533821509","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}