{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:58:50Z","timestamp":1760061530632},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,16]],"date-time":"2014-03-16T00:00:00Z","timestamp":1394928000000},"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":[[2014,10]]},"DOI":"10.1007\/s10601-014-9163-9","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T05:27:57Z","timestamp":1395120477000},"page":"434-462","source":"Crossref","is-referenced-by-count":11,"title":["Symmetries, almost symmetries, and lazy clause generation"],"prefix":"10.1007","volume":"19","author":[{"given":"Geoffrey","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Garcia de la Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Mears","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,16]]},"reference":[{"key":"9163_CR1","doi-asserted-by":"crossref","unstructured":"Backofen, R., & Will, S. (1999). Excluding symmetries in constraint-based search. In J. Jaffar (Ed.), Proceedings of the 5th international conference on principles and practice of constraint programming, Lecture Notes in Computer Science (Vol. 1713, pp. 73\u201387). Springer.","DOI":"10.1007\/978-3-540-48085-3_6"},{"key":"9163_CR2","unstructured":"Benhamou, B. (1994). Study of symmetry in constraint satisfaction problems. In PPCP\u201994: 2nd international workshop on principles and practice of constraint programming (pp. 246\u2013254)."},{"key":"9163_CR3","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L. (2004). Boosting systematic search by weighting constraints. In Proceedings of the European conference on artificial intelligence (pp. 146\u2013150)."},{"key":"9163_CR4","unstructured":"Chu, G., Garcia de la Banda, M., Mears, C., Stuckey, P. (2011). Symmetries and lazy clause generation. In Proceedings of the 22nd international joint conference on artificial intelligence (pp. 516\u2013521)."},{"issue":"2\u20133","key":"9163_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10601-006-8059-8","volume":"11","author":"DA Cohen","year":"2006","unstructured":"Cohen, D.A., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M. (2006). Symmetry definitions for constraint satisfaction problems. Constraints, 11(2\u20133), 115\u2013137.","journal-title":"Constraints"},{"key":"9163_CR6","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proceedings of the 5th international conference on principles of knowledge representation and reasoning (pp. 148\u2013159). Morgan Kaufmann."},{"key":"9163_CR7","unstructured":"Donaldson, A. (2005). Partial symmetry in model checking. In SymNet workshop on almost-symmetry in search (pp. 17\u201321). http:\/\/www.allydonaldson.co.uk\/edited_volumes\/SymNet2005.pdf ."},{"key":"9163_CR8","doi-asserted-by":"crossref","unstructured":"Fahle, T., Schamberger, S., Sellmann, M. (2001). Symmetry breaking. In T. Walsh (Ed.), Proceedings of the 7th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 2239, pp. 93\u2013107). Springer.","DOI":"10.1007\/3-540-45578-7_7"},{"key":"9163_CR9","doi-asserted-by":"crossref","unstructured":"Feydy, T., & Stuckey, P.J. (2009). Lazy clause generation reengineered. In I. P. Gent (Ed.), Proceedings of the 15th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 5732, pp. 352\u2013366). Springer.","DOI":"10.1007\/978-3-642-04244-7_29"},{"key":"9163_CR10","doi-asserted-by":"crossref","unstructured":"Frisch, A., Miguel, I., Walsh, T. (2003). CGRASS: a system for transforming constraint satisfaction problems. In recent advances in constraints, joint ERCIM\/Colognet international workshop on constraint solving and constraint logic programming (pp. 15\u201330).","DOI":"10.1007\/3-540-36607-5_2"},{"key":"9163_CR11","doi-asserted-by":"crossref","unstructured":"Gargani, A., & Refalo, P. (2007). An efficient model and strategy for the steel mill slab design problem. In C. Bessiere (Ed.), Proceedings of the 13th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 4741, pp. 77\u201389). Springer.","DOI":"10.1007\/978-3-540-74970-7_8"},{"issue":"3","key":"9163_CR12","first-page":"211","volume":"20","author":"IP Gent","year":"2007","unstructured":"Gent, I.P., Jefferson, C., Kelsey, T., Lynce, I., Miguel, I., Nightingale, P., Smith, B.M., Tarim, A. (2007). Search in the patience game \u2019Black Hole\u2019. AI Communications, 20(3), 211\u2013226.","journal-title":"AI Communications"},{"key":"9163_CR13","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Kelsey, T., Linton, S., McDonald, I., Miguel, I., Smith, B.M. (2005). Conditional symmetry breaking. In P. van Beek (Ed.), Proceedings of the 11th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 3709, pp. 256\u2013270). Springer.","DOI":"10.1007\/11564751_21"},{"key":"9163_CR14","unstructured":"Gent, I.P., & Smith, B.M. (2000). Symmetry breaking in constraint programming. In W. Horn (Ed.), Proceedings of the 14th European conference on artificial intelligence, (pp. 599\u2013603). IOS Press."},{"key":"9163_CR15","unstructured":"Gomes, C., & Shmoys, D.B. (2002). Completing quasigroups or latin squares: a structured graph colouring problem. In D. S. Johnson, A. Mehrotra, M. Trick (Eds.) Proceedings of the computational symposium on graph colouring and extensions (pp. 22\u201339)."},{"key":"9163_CR16","unstructured":"Gregory, P. (2005). Almost-symmetry in planning. In SymNet workshop on almost-symmetry in search (pp. 14\u201316). http:\/\/www.allydonaldson.co.uk\/edited_volumes\/SymNet2005.pdf ."},{"key":"9163_CR17","unstructured":"Harvey, W. (2005). Symmetric relaxation techniques for constraint programming. In SymNet workshop on almost-symmetry in search (pp. 50\u201359). http:\/\/www.allydonaldson.co.uk\/edited_volumes\/SymNet2005.pdf ."},{"issue":"3","key":"9163_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF00265682","volume":"22","author":"B Krishnamurthy","year":"1985","unstructured":"Krishnamurthy, B. (1985). Short proofs for tricky formulas. Acta Informatica, 22(3), 253\u2013275.","journal-title":"Acta Informatica"},{"key":"9163_CR19","doi-asserted-by":"crossref","unstructured":"Law, Y.C., Lee, J.H.M., Walsh, T., Yip, J.Y.K. (2007). Breaking symmetry of interchangeable variables and values. In C. Bessiere (Ed.), Proceedings of the 13th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 4741, pp. 423\u2013437). Springer.","DOI":"10.1007\/978-3-540-74970-7_31"},{"key":"9163_CR20","unstructured":"Martin, R. (2005). The challenge of exploiting weak symmetries. In B. Hnich, M. Carlsson, F. Fages, F. Rossi (Eds.), Proceedings of the international workshop on constraint solving and constraint logic programming, lecture notes in computer science (Vol. 3978, pp. 149\u2013163). Springer."},{"key":"9163_CR21","unstructured":"Mears, C. (2009). Automatic symmetry detection and dynamic symmetry breaking for constraint programming. PhD thesis, Clayton School of Information Technology, Monash University."},{"issue":"4","key":"9163_CR22","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10601-008-9057-9","volume":"14","author":"C Mears","year":"2009","unstructured":"Mears, C., de la Banda, G.M., Wallace, M. (2009). On implementing symmetry detection. Constraints, 14(4), 443\u2013477.","journal-title":"Constraints"},{"key":"9163_CR23","doi-asserted-by":"crossref","unstructured":"Mears, C., de la Banda, G.M., Wallace, M., Demoen, B. (2008). A novel approach for detecting symmetries in CSP models. In L. Perron, M. Trick (Eds.), Proceedings of the 8th international conference on integration of artificial intelligence (AI) and operations research (OR) techniques in constraint programming, lecture notes in computer science (Vol. 5015, pp. 158\u2013172). Springer.","DOI":"10.1007\/978-3-540-68155-7_14"},{"key":"9163_CR24","doi-asserted-by":"crossref","unstructured":"Mears, C., Niven, T., Jackson, M., Wallace, M. (2011). Proving symmetries by model transformation. In J. Lee (Ed.), Proceedings of the 17th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 6876, pp. 591\u2013605). Springer.","DOI":"10.1007\/978-3-642-23786-7_45"},{"issue":"1\u20132","key":"9163_CR25","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. (2001). Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129(1\u20132), 133\u2013163.","journal-title":"Artificial Intelligence"},{"key":"9163_CR26","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S. (2001). Chaff: engineering an efficient SAT solver. In Proceedings of the 38th design automation conference (pp. 530\u2013535). ACM.","DOI":"10.1145\/378239.379017"},{"key":"9163_CR27","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P., Becket, R., Brand, S., Duck, G., Tack, G. (2007). Minizinc: towards a standard CP modelling language. In C. Bessiere (Ed.), Proceedings of the 13th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 4741, pp. 529\u2013543). Springer-Verlag.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9163_CR28","doi-asserted-by":"crossref","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M. (2007). Propagation = lazy clause generation. In C. Bessiere (Ed.), Proceedings of the 13th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 4741, pp. 544\u2013558). Springer.","DOI":"10.1007\/978-3-540-74970-7_39"},{"key":"9163_CR29","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2002). Symmetry breaking revisited. In P. Van Hentenryck (Ed.), Proceedings of the 8th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 2470, pp. 446\u2013461). Springer.","DOI":"10.1007\/3-540-46135-3_30"},{"key":"9163_CR30","doi-asserted-by":"crossref","unstructured":"Puget, J.-F. (2003). Symmetry breaking using stabilizers. In F. Rossi (Ed.), Proceedings of the 9th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 2470, pp. 585\u2013589). Springer.","DOI":"10.1007\/978-3-540-45193-8_40"},{"key":"9163_CR31","unstructured":"Roney-Dougal, C., Gent, I., Kelsey, T., Linton, S. (2004). Tractable symmetry breaking using restricted search trees. In Proceedings of the 16th European conference on artificial intelligence, (pp. 211\u2013215). IOS Press."},{"key":"9163_CR32","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M. (2009). Why cumulative decomposition is not as bad as it sounds. In I. P. Gent (Ed.), Proceedings of the 15th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 5732, pp. 746\u2013761). Springer.","DOI":"10.1007\/978-3-642-04244-7_58"},{"key":"9163_CR33","doi-asserted-by":"crossref","unstructured":"Schutt, A., Stuckey, P.J., Verden, A.R. (2011). Optimal carpet cutting. In J. Lee (Ed.), Proceedings of the 17th international conference on principles and practice of constraint programming, lecture notes in computer science (Vol. 6876, pp. 69\u201384). Springer.","DOI":"10.1007\/978-3-642-23786-7_8"},{"key":"9163_CR34","unstructured":"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S. (2001). Efficient conflict driven learning in Boolean satisfiability solver. In Proceedings of the international conference on computer-aided design (pp. 279\u2013285). ACM."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9163-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-014-9163-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9163-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T15:05:22Z","timestamp":1565276722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-014-9163-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,16]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9163"],"URL":"https:\/\/doi.org\/10.1007\/s10601-014-9163-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,16]]}}}