{"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":1772668630438,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,6,14]],"date-time":"2006-06-14T00:00:00Z","timestamp":1150243200000},"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":[[2006,7]]},"DOI":"10.1007\/s10601-006-8059-8","type":"journal-article","created":{"date-parts":[[2006,6,15]],"date-time":"2006-06-15T18:07:28Z","timestamp":1150394848000},"page":"115-137","source":"Crossref","is-referenced-by-count":37,"title":["Symmetry Definitions for Constraint Satisfaction Problems"],"prefix":"10.1007","volume":"11","author":[{"given":"David","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jeavons","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Jefferson","sequence":"additional","affiliation":[]},{"given":"Karen E.","family":"Petrie","sequence":"additional","affiliation":[]},{"given":"Barbara M.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,14]]},"reference":[{"key":"8059_CR1","unstructured":"Aguirre, A. (1992). How to use symmetries in Boolean constraint solving. In F. Benhamou & A. Colmerauer (Eds.), Constraint Logic Programming: Selected Research (pp. 287\u2013306). MIT Press."},{"key":"8059_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-48085-3_6","volume-title":"Principles and Practice of Constraint Programming-CP\u201999, LNCS 1713","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Principles and Practice of Constraint Programming-CP\u201999, LNCS 1713, (pp. 73\u201387). Berlin Heidelberg New York: Springer."},{"key":"8059_CR3","unstructured":"Benhamou, B. (1994). Study of symmetry in constraint satisfaction problems. In Proceedings of the 2nd Workshop on Principles and Practice of Constraint Programming, {PPCP\u201994} (pp. 246\u2013254)"},{"key":"8059_CR4","first-page":"281","volume-title":"Automated Deduction\u2014CADE-11, LNAI 607","author":"B. Benhamou","year":"1992","unstructured":"Benhamou, B., & Sais, L. (1992). Theoretical study of symmetries in propositional calculus and applications. In D. Kapur (Ed.), Automated Deduction\u2014CADE-11, LNAI 607, (pp. 281\u2013294). Berlin Heidelberg New York: Springer."},{"key":"8059_CR5","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1007\/978-3-540-30201-8_53","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2004, Vol. LNCS 3258","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., & Walsh, T. (2004) The tractability of global constraints. In M. Wallace (Ed.), Principles and Practice of Constraint Programming\u2014CP 2004, Vol. LNCS 3258, (pp. 716\u2013720). Berlin Heidelberg New York: Springer."},{"key":"8059_CR6","first-page":"99","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 357","author":"C. A. Brown","year":"1988","unstructured":"Brown, C. A., Finkelstein, L., & Purdom, J. P. W. (1988). Backtrack searching in the presence of symmetry. In T. Mora (Ed.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 357, (pp. 99\u2013110). Berlin Heidelberg New York: Springer."},{"key":"8059_CR7","unstructured":"Crawford, J., Ginsberg, M., Luks, E., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proceedings KR\u201996 (pp. 149\u2013159)."},{"key":"8059_CR8","first-page":"225","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2001, LNCS 2239","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., & Sellmann, M. (2001). Symmetry breaking. In T. Walsh (Ed.), Principles and Practice of Constraint Programming\u2014CP 2001, LNCS 2239, (pp. 225\u2013239). Berlin Heidelberg New York: Springer."},{"key":"8059_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45578-7_6","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2001, LNCS 2239","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., & Milano, M. (2001). Global cut framework for removing symmetries. In T. Walsh (Ed.), Principles and Practice of Constraint Programming\u2014CP 2001, LNCS 2239, (pp. 77\u201392). Berlin Heidelberg New York: Springer."},{"key":"8059_CR10","unstructured":"Freuder, E. C. (1991). Eliminating interchangeable values in constraint satisfaction problems. In Proceedings AAAI\u201991, Vol. 1, (pp. 227\u2013233)."},{"key":"8059_CR11","unstructured":"The GAP Group. (2005). GAP\u2014Groups, Algorithms, and Programming, Version 4.4. (http:\/\/www.gap-system.org)."},{"key":"8059_CR12","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2003, LNCS","author":"I. P. Gent","year":"2003","unstructured":"Gent, I. P., Harvey, W., Kelsey, T., & Linton, S. (2003). Generic SBDD using computational group theory. In F. Rossi (Ed.), Principles and Practice of Constraint Programming\u2014CP 2003, LNCS. Berlin Heidelberg New York: Springer."},{"key":"8059_CR13","unstructured":"Gent, I. P., & Smith, B. M. (2000). Symmetry breaking during search in constraint programming. In W. Horn (Ed.), Proceedings ECAI\u20192000, the European Conference on Artificial Intelligence (pp. 599\u2013603)."},{"key":"8059_CR14","unstructured":"J\u00e9gou, P. (1993). Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems. In Proceedings AAAI\u201993 (pp. 731\u2013736)."},{"key":"8059_CR15","unstructured":"McKay, B. (1981). Practical graph isomorphism. Congressus Numerantium, 30, 45\u201387. (The software tool NAUTY is available for download from http:\/\/cs.anu.edu.au\/~bdm\/nauty\/)."},{"key":"8059_CR16","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0004-3702(01)00104-7","volume":"129","author":"P. Meseguer","year":"2001","unstructured":"Meseguer, P., & Torras, C. (2001). Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129, 133\u2013163.","journal-title":"Artificial Intelligence"},{"key":"8059_CR17","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1007\/978-3-540-45193-8_81","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2003, LNCS 2833","author":"K. E. Petrie","year":"2003","unstructured":"Petrie, K. E., & Smith, B. M. (2003). Symmetry breaking in graceful graphs. In F. Rossi (Ed.), Principles and Practice of Constraint Programming\u2014CP 2003, LNCS 2833, (pp. 930\u2013934). Berlin Heidelberg New York: Springer."},{"key":"8059_CR18","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems (Proceedings of ISMIS'93), LNAI 689","author":"J.-F. Puget","year":"1993","unstructured":"Puget, J.-F. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In J. Komorowski & Z. W. Ras (Eds.), Methodologies for Intelligent Systems (Proceedings of ISMIS\u201993), LNAI 689, (pp. 350\u2013361). Berlin Heidelberg New York: Springer."},{"key":"8059_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/11564751_36","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2005, LNCS 3709","author":"J.-F. Puget","year":"2005","unstructured":"Puget, J.-F. (2005). Automatic detection of variable and value symmetries. In P. van Beek (Ed.), Principles and Practice of Constraint Programming\u2014CP 2005, LNCS 3709, (pp. 475\u2013489). Berlin Heidelberg New York: Springer."},{"key":"8059_CR20","first-page":"98","volume-title":"Recent Advances in Constraints, Joint ERCIM\/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, LNCS 3419","author":"A. Ramani","year":"2005","unstructured":"Ramani, A., & Markov, I. L. (2005). Automatically exploiting symmetries in constraint programming. In B. Faltings, A. Petcu, F. Fages & F. Rossi (Eds.), Recent Advances in Constraints, Joint ERCIM\/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, LNCS 3419, (pp. 98\u2013112). Berlin Heidelberg New York: Springer."},{"key":"8059_CR21","unstructured":"Roy, P., & Pachet, F. (1998). Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In Workshop on Non Binary Constraints, ECAI-98."},{"key":"8059_CR22","doi-asserted-by":"crossref","unstructured":"Walsh, T. (2000). SAT v CSP. In Proceedings CP\u20192000 (pp. 441\u2013456).","DOI":"10.1007\/3-540-45349-0_32"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-8059-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-006-8059-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-8059-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:13Z","timestamp":1559229253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-006-8059-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,14]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["8059"],"URL":"https:\/\/doi.org\/10.1007\/s10601-006-8059-8","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,14]]}}}