{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:57:10Z","timestamp":1772668630813,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,23]],"date-time":"2008-07-23T00:00:00Z","timestamp":1216771200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10601-008-9057-9","type":"journal-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T07:38:57Z","timestamp":1216712337000},"page":"443-477","source":"Crossref","is-referenced-by-count":14,"title":["On implementing symmetry detection"],"prefix":"10.1007","volume":"14","author":[{"given":"C.","family":"Mears","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Garcia de la Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,23]]},"reference":[{"key":"9057_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R., & Wallace, M.\u00a0G. (2006). Constraint logic programming using ECLiPSe. Cambridge University Press.","DOI":"10.1017\/CBO9780511607400"},{"key":"9057_CR2","doi-asserted-by":"crossref","unstructured":"Cohen, D., Jeavons, P., Jefferson, C., Petrie, K.\u00a0E., & Smith, B.\u00a0M. (2005). Symmetry definitions for constraint satisfaction problems. In P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 17\u201331). Springer.","DOI":"10.1007\/11564751_5"},{"key":"9057_CR3","first-page":"148","volume-title":"KR\u201996: Principles of knowledge representation and reasoning","author":"J. Crawford","year":"1996","unstructured":"Crawford, J., Ginsberg, M.\u00a0L., Luck, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In L. C. Aiello, J. Doyle, S. Shapiro (Eds.), KR\u201996: Principles of knowledge representation and reasoning (pp. 148\u2013159). San Francisco, CA: Morgan Kaufmann."},{"key":"9057_CR4","doi-asserted-by":"crossref","unstructured":"Darga, P.\u00a0T., Liffiton, M.\u00a0H., Sakallah, K.\u00a0A., & Markov, I.\u00a0L. (2004). Exploiting structure in symmetry detection for CNF. In S. Malik, L. Fix, A. B. Kahng (Eds.), DAC (pp. 530\u2013534). ACM.","DOI":"10.1145\/996566.996712"},{"key":"9057_CR5","unstructured":"Freuder, E.\u00a0C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proc. AAAI\u201991 (Vol. 1, pp. 227\u2013233)."},{"key":"9057_CR6","doi-asserted-by":"crossref","unstructured":"Frisch, A.\u00a0M., Miguel, I., & Walsh, T. (2003). CGRASS: A system for transforming constraint satisfaction problems. In B. O\u2019Sullivan (Ed.), Recent advances in constraints, joint ERCIM\/CologNet international workshop on constraint solving and constraint logic programming, LNCS (Vol. 2627, pp.\u00a015\u201330).","DOI":"10.1007\/3-540-36607-5_2"},{"key":"9057_CR7","doi-asserted-by":"crossref","unstructured":"Gent, I.\u00a0P., Harvey, W., & Kelsey, T. (2002). Groups and constraints: Symmetry breaking during search. In P. van Hentenryck (Ed.), CP2002, LNCS (Vol. 2470, pp. 415\u2013430). Springer.","DOI":"10.1007\/3-540-46135-3_28"},{"key":"9057_CR8","unstructured":"Gent, I.\u00a0P., & Walsh, T. (1999). CSPLib: A benchmark library for constraints. Technical report, Technical report APES-09-1999. A shorter version appears in the proceedings of the 5th international conference on principles and practices of constraint programming (CP-99). Available from http:\/\/www.csplib.org\/ ."},{"key":"9057_CR9","unstructured":"J\u00e9gou, P. (1993). Decomposition of domains based on the micro-structure of finite constraint satisfaction problems. In AAAI93: Proceedings of the 11th national conference on artificial intelligence (pp. 731\u2013736)."},{"key":"9057_CR10","first-page":"45","volume":"30","author":"B. D. McKay","year":"1981","unstructured":"McKay, B.\u00a0D. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45\u201387.","journal-title":"Congressus Numerantium"},{"key":"9057_CR11","unstructured":"Pearson, J., van Hentenryck, P., Flener, P., & \u0226gren, M. (2005). Compositional derivation of symmetries for constraint satisfaction. In Proceedings of the international symposium on abstraction, reformulation, and approximation (SARA\u201905)."},{"key":"9057_CR12","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2002). Symmetry breaking revisited. In P. Van Hentenryck (Ed.), CP2002, LNCS (Vol. 2470, pp. 446\u2013461). Springer.","DOI":"10.1007\/3-540-46135-3_30"},{"key":"9057_CR13","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2005). Automatic detection of variable and value symmetries. P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 475\u2013489). Springer.","DOI":"10.1007\/11564751_36"},{"key":"9057_CR14","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2005). Breaking all value symmetries in surjection problems. In P. van Beek (Ed.), CP2005, LNCS (Vol. 3709, pp. 490\u2013504). Springer.","DOI":"10.1007\/11564751_37"},{"key":"9057_CR15","unstructured":"Ramani, A., & Markov, I.\u00a0L. (2004). Automatically exploiting symmetries in constraint programming. In B.\u00a0Faltings, A.\u00a0Petcu, F.\u00a0Fages, F.\u00a0Rossi (Eds.), CSCLP (Vol. 3419, pp. 98\u2013112)."},{"key":"9057_CR16","unstructured":"Roy, P., & Pachet, F. (1998). Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In ECAI98 workshop on non-binary constraints (pp. 27\u201333)."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9057-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-008-9057-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9057-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:14Z","timestamp":1559243654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-008-9057-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,23]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9057"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9057-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,23]]}}}