{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:20:49Z","timestamp":1725747649887},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406263"},{"type":"electronic","value":"9783642406270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40627-0_41","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"545-561","source":"Crossref","is-referenced-by-count":4,"title":["Breaking Symmetry with Different Orderings"],"prefix":"10.1007","author":[{"given":"Nina","family":"Narodytska","sequence":"first","affiliation":[]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","series-title":"LNAI","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 (LNAI), vol.\u00a0689, pp. 350\u2013361. Springer, Heidelberg (1993)"},{"key":"41_CR2","unstructured":"Crawford, J., Luks, G., Ginsberg, M., Roy, A.: Symmetry breaking predicates for search problems. In: Proceedings of the 5th International Conference on Knowledge Representation and Reasoning (KR 1996), pp. 148\u2013159 (1996)"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Shlyakhter, I.: Generating effective symmetry-breaking predicates for search problems. In: Proceedings of LICS Workshop on Theory and Applications of Satisfiability Testing, SAT 2001 (2001)","DOI":"10.1016\/S1571-0653(04)00311-7"},{"key":"41_CR4","unstructured":"Aloul, F., Sakallah, K., Markov, I.: Efficient symmetry breaking for Boolean satisfiability. In: Proceedings of the 18th International Joint Conference on AI, International Joint Conference on Artificial Intelligence, pp. 271\u2013276 (2003)"},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-30201-8_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Y.C. Law","year":"2004","unstructured":"Law, Y.C., Lee, J.H.M.: Global constraints for integer and set value precedence. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 362\u2013376. Springer, Heidelberg (2004)"},{"key":"41_CR6","unstructured":"Puget, J.F.: Breaking symmetries in all different problems. In: Proceedings of 19th IJCAI, International Joint Conference on Artificial Intelligence, pp. 272\u2013277 (2005)"},{"issue":"2-3","key":"41_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10601-006-7095-8","volume":"11","author":"Y. Law","year":"2006","unstructured":"Law, Y., Lee, J.: Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction. Constraints\u00a011(2-3), 221\u2013267 (2006)","journal-title":"Constraints"},{"key":"41_CR8","unstructured":"Walsh, T.: Symmetry breaking using value precedence. In: Proc. of the 17th European Conference on Artificial Intelligence (ECAI 2006), European Conference on Artificial Intelligence. IOS Press (2006)"},{"key":"41_CR9","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.\u00a04204, pp. 650\u2013664. Springer, Heidelberg (2006)"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-74970-7_31","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"Y.C. Law","year":"2007","unstructured":"Law, Y.C., Lee, J.H.M., Walsh, T., Yip, J.Y.K.: Breaking symmetry of interchangeable variables and values. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 423\u2013437. Springer, Heidelberg (2007)"},{"key":"41_CR11","unstructured":"Walsh, T.: Breaking value symmetry. In: Fox, D., Gomes, C. (eds.) Proceedings of the 23rd National Conference on AI, Association for Advancement of Artificial Intelligence, pp. 1585\u20131588 (2008)"},{"key":"41_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-15396-9_26","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"G. Katsirelos","year":"2010","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: On the complexity and completeness of static constraints for breaking row and column symmetry. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 305\u2013320. Springer, Heidelberg (2010)"},{"key":"41_CR13","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier (2006)"},{"key":"41_CR14","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.\u00a05732, pp. 391\u2013399. Springer, Heidelberg (2009)"},{"key":"41_CR15","unstructured":"Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Multiset ordering constraints. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), International Joint Conference on Artificial Intelligence (2003)"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-55602-8_172","volume-title":"Automated Deduction - CADE-11","author":"B. Benhamou","year":"1992","unstructured":"Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and applications. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 281\u2013294. Springer, Heidelberg (1992)"},{"issue":"1","key":"41_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00881844","volume":"12","author":"B. Benhamou","year":"1994","unstructured":"Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. Journal of Automated Reasoning\u00a012(1), 89\u2013102 (1994)","journal-title":"Journal of Automated Reasoning"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-48085-3_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 73\u201387. Springer, Heidelberg (1999)"},{"key":"41_CR19","unstructured":"Gent, I., Smith, B.: Symmetry breaking in constraint programming. In: Horn, W. (ed.) Proceedings of ECAI 2000, pp. 599\u2013603. IOS Press (2000)"},{"key":"41_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45578-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"key":"41_CR21","unstructured":"Sellmann, M., Hentenryck, P.V.: Structural symmetry breaking. In: Proceedings of 19th Internatinal Joint Conference on AI (IJCAI 2005), International Joint Conference on Artificial Intelligence, pp. 298\u2013303 (2005)"},{"key":"41_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/11889205_33","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"J.-F. Puget","year":"2006","unstructured":"Puget, J.-F.: Dynamic lex constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 453\u2013467. Springer, Heidelberg (2006)"},{"key":"41_CR23","unstructured":"Katsirelos, G., Walsh, T.: Symmetries of symmetry breaking constraints. In: Proc. of the 19th European Conference on Artificial Intelligence (ECAI 2010), European Conference on Artificial Intelligence. IOS Press (2010)"},{"key":"41_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-38171-3_28","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Narodytska","year":"2013","unstructured":"Narodytska, N., Walsh, T.: An adaptive model restarts heuristic. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol.\u00a07874, pp. 369\u2013377. Springer, Heidelberg (2013)"},{"issue":"2-3","key":"41_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10601-006-8059-8","volume":"11","author":"D. Cohen","year":"2006","unstructured":"Cohen, D., Jeavons, P., Jefferson, C., Petrie, K., Smith, B.: Symmetry definitions for constraint satisfaction problems. Constraints\u00a011(2-3), 115\u2013137 (2006)","journal-title":"Constraints"},{"key":"41_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/11564751_21","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"I.P. Gent","year":"2005","unstructured":"Gent, I.P., Kelsey, T., Linton, S.A., McDonald, I., Miguel, I., Smith, B.M.: Conditional symmetry breaking. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 256\u2013270. Springer, Heidelberg (2005)"},{"key":"41_CR27","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Symmetry in matrix models. In: Proceedings of the CP 2001 Workshop on Symmetry in Constraints (SymCon 2001), Held alongside CP, Also APES-30-2001 technical report (2001)"},{"key":"41_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46135-3_7","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A. Frisch","year":"2002","unstructured":"Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global constraints for lexicographic orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 93\u2013108. Springer, Heidelberg (2002)"},{"issue":"10","key":"41_CR29","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.artint.2006.03.002","volume":"170","author":"A. Frisch","year":"2006","unstructured":"Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Propagation algorithms for lexicographic ordering constraints. Artificial Intelligence\u00a0170(10), 803\u2013908 (2006)","journal-title":"Artificial Intelligence"},{"key":"41_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03251-6_6","volume-title":"Recent Advances in Constraints","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Combining symmetry breaking and global constraints. In: Oddi, A., Fages, F., Rossi, F. (eds.) CSCLP 2008. LNCS, vol.\u00a05655, pp. 84\u201398. Springer, Heidelberg (2009)"},{"key":"41_CR31","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling. In: Proceedings of the CP 2001 Workshop on Modelling and Problem Formulation, Held alongside CP 2001 (2001)"},{"key":"41_CR32","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling: Exploiting common patterns in constraint programming. In: Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, Held alongside CP 2002 (2002)"},{"key":"41_CR33","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.\u00a02470, pp. 462\u2013472. Springer, Heidelberg (2002)"},{"key":"41_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.-G. Quimper","year":"2007","unstructured":"Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"41_CR35","doi-asserted-by":"crossref","unstructured":"Gent, I., Walsh, T.: 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 (1999)","DOI":"10.1007\/978-3-540-48085-3_36"},{"issue":"1-4","key":"41_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/B:ANOR.0000032569.86938.2f","volume":"130","author":"R. Bosch","year":"2004","unstructured":"Bosch, R., Trick, M.: Constraint programming and hybrid formulations for three life designs. Annals OR\u00a0130(1-4), 41\u201356 (2004)","journal-title":"Annals OR"},{"key":"41_CR37","first-page":"6","volume":"62","author":"R. Bosch","year":"1999","unstructured":"Bosch, R.: Peaceably coexisting armies of Queens. Optima (Newsletter of the Mathematical Programming Society)\u00a062, 6\u20139 (1999)","journal-title":"Optima (Newsletter of the Mathematical Programming Society)"},{"key":"41_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-24664-0_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B. Smith","year":"2004","unstructured":"Smith, B., Petrie, K., Gent, I.: Models and symmetry breaking for peacable armies of queens. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 271\u2013286. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40627-0_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T02:13:14Z","timestamp":1558059194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}