{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:22:17Z","timestamp":1751098937203,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319906850"},{"type":"electronic","value":"9783319906867"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90686-7_12","type":"book-chapter","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T13:49:55Z","timestamp":1524491395000},"page":"182-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking Symmetries with Lex Implications"],"prefix":"10.1007","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Ehlers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avraham","family":"Itzhakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,24]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems","author":"J-F Puget","year":"1993","unstructured":"Puget, J.-F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689, pp. 350\u2013361. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56804-2_33"},{"key":"12_CR2","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Aiello, L.C., Doyle, J., Shapiro, S.C. (eds.): Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), Cambridge, Massachusetts, USA, 5\u20138 November 1996, pp. 148\u2013159. Morgan Kaufmann (1996)"},{"issue":"12","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.dam.2005.10.018","volume":"155","author":"I Shlyakhter","year":"2007","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. Discrete Appl. Math. 155(12), 1539\u20131548 (2007)","journal-title":"Discrete Appl. Math."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/11889205_46","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T Walsh","year":"2006","unstructured":"Walsh, T.: General symmetry breaking constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 650\u2013664. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889205_46"},{"key":"12_CR5","unstructured":"Walsh, T.: Symmetry breaking constraints: recent results. In: Hoffmann, J., Selman, B. (eds.) Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, Toronto, Ontario, Canada, 22\u201326 July 2012. AAAI Press (2012)"},{"key":"12_CR6","unstructured":"Codish, M., Miller, A., Prosser, P., Stuckey, P.J.: Breaking symmetries in graph representation. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 3\u20139 August 2013, pp. 510\u2013516. IJCAI\/AAAI (2013)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P Flener","year":"2002","unstructured":"Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking row and column symmetries in matrix models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 462\u2013477. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_31"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-45193-8_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"AM Frisch","year":"2003","unstructured":"Frisch, A.M., Jefferson, C., Miguel, I.: Constraints for breaking more row and column symmetries. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 318\u2013332. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_22"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-04244-7_32","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"A Grayland","year":"2009","unstructured":"Grayland, A., Miguel, I., Roney-Dougal, C.M.: Snake lex: an alternative to double lex. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 391\u2013399. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_32"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"RC Read","year":"1978","unstructured":"Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Ann. Discrete Math. 2, 107\u2013120 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-016-9244-z","volume":"21","author":"A Itzhakov","year":"2016","unstructured":"Itzhakov, A., Codish, M.: Breaking symmetries in graph search with canonizing sets. Constraints 21(3), 357\u2013374 (2016)","journal-title":"Constraints"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H.: The quest for perfect and compact symmetry breaking for graph problems. In: Davenport, J.H., Negru, V., Ida, T., Jebelean, T., Petcu, D., Watt, S.M., Zaharie, D. (eds.) 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, 24\u201327 September 2016, pp. 149\u2013156. IEEE Computer Society (2016)","DOI":"10.1109\/SYNASC.2016.034"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Frisch, A.M., Harvey, W.: Constraints for breaking all row and column symmetries in a three-by-two matrix. In: Proceedings of SymCon 2003 (2003)","DOI":"10.1007\/978-3-540-45193-8_22"},{"issue":"10","key":"12_CR14","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.artint.2006.03.002","volume":"170","author":"AM Frisch","year":"2006","unstructured":"Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artif. Intell. 170(10), 803\u2013834 (2006)","journal-title":"Artif. Intell."},{"key":"12_CR15","unstructured":"Smith, B.: Symmetry breaking constraints in constraint programming (2010). Slides published online. http:\/\/ta.twi.tudelft.nl\/wst\/users\/achill\/MFOSymOpt2010\/MFOSymOpt2010\/Oberwolfach_Mini-Workshop_files\/BarbaraMfoSlides.ppt"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1613\/jair.3809","volume":"46","author":"A Metodi","year":"2013","unstructured":"Metodi, A., Codish, M., Stuckey, P.J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems. J. Artif. Intell. Res. (JAIR) 46, 303\u2013341 (2013)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"12_CR17","unstructured":"Audemard, G., Simon, L.: Glucose 4.0 SAT solver. http:\/\/www.labri.fr\/perso\/lsimon\/glucose\/"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187, 52\u201389 (2012)","journal-title":"Artif. Intell."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1002\/jgt.3190090417","volume":"9","author":"RD Cameron","year":"1985","unstructured":"Cameron, R.D., Colbourn, C.J., Read, R.C., Wormald, N.C.: Cataloguing the graphs on 10 vertices. J. Graph Theor. 9(4), 551\u2013562 (1985)","journal-title":"J. Graph Theor."},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293\u2013304 (1986)","journal-title":"J. Symb. Comput."},{"key":"12_CR21","unstructured":"The on-line encyclopedia of integer sequences. Published electronically (2010). http:\/\/oeis.org"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-72397-4_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"O Fourdrinoy","year":"2007","unstructured":"Fourdrinoy, O., Gr\u00e9goire, \u00c9., Mazure, B., Sa\u00efs, L.: Eliminating redundant clauses in SAT instances. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 71\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72397-4_6"},{"key":"12_CR23","unstructured":"Radziszowski, S.P.: Small Ramsey numbers. Electron. J. Comb. (1994). Revision 14 January 2014"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90686-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T18:30:18Z","timestamp":1571250618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90686-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319906850","9783319906867"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90686-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}