{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:05:26Z","timestamp":1740096326326,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"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_11","type":"book-chapter","created":{"date-parts":[[2013,9,7]],"date-time":"2013-09-07T07:11:01Z","timestamp":1378537861000},"page":"107-116","source":"Crossref","is-referenced-by-count":10,"title":["Automated Symmetry Breaking and Model Selection in Conjure"],"prefix":"10.1007","author":[{"given":"Ozgur","family":"Akgun","sequence":"first","affiliation":[]},{"given":"Alan M.","family":"Frisch","sequence":"additional","affiliation":[]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[]},{"given":"Bilal Syed","family":"Hussain","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Jefferson","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Kotthoff","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Akgun, O., Miguel, I., Jefferson, C., Frisch, A.M., Hnich, B.: Extensible automated constraint modelling. In: AAAI 2011: Twenty-Fifth Conference on Artificial Intelligence (2011)","DOI":"10.1609\/aaai.v25i1.7820"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N. Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: Extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 141\u2013157. Springer, Heidelberg (2012)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-30201-8_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Coletta, R., Freuder, E.C., O\u2019Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 123\u2013137. Springer, Heidelberg (2004)"},{"key":"11_CR4","unstructured":"Bessiere, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: Acquiring constraint networks using a SAT-based version space algorithm. In: AAAI 2006, pp. 1565\u20131568 (2006)"},{"key":"11_CR5","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11\u201318. Morgan Kaufmann (2002)"},{"key":"11_CR6","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Proc. of ECAI 2006, pp. 73\u201377. IOS Press (2006)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-540-45193-8_58","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R. Coletta","year":"2003","unstructured":"Coletta, R., Bessi\u00e8re, C., O\u2019Sullivan, B., Freuder, E.C., O\u2019Connell, S., Quinqueton, J.: Semi-automatic modeling by constraint acquisition. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 812\u2013816. Springer, Heidelberg (2003)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1007\/978-3-540-45193-8_95","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"P. Flener","year":"2003","unstructured":"Flener, P., Pearson, J., \u00c5gren, M.: Introducing esra, a relational language for modelling combinatorial problems (Abstract). In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 971\u2013971. Springer, Heidelberg (2003)"},{"key":"11_CR9","unstructured":"Frisch, A.M., Jefferson, C., Hernandez, B.M., Miguel, I.: The rules of constraint modelling. In: Proc. of the IJCAI 2005, pp. 109\u2013116 (2005)"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"A.M. Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints\u00a013(3), 268\u2013306 (2008), http:\/\/dx.doi.org\/10.1007\/s10601-008-9047-y","journal-title":"Constraints"},{"key":"11_CR11","unstructured":"Frisch, A.M., Jefferson, C., Martinez-Hernandez, B., Miguel, I.: Symmetry in the generation of constraint models. In: Proceedings of the International Symmetry Conference (2007)"},{"key":"11_CR12","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":"A. Frisch","year":"2003","unstructured":"Frisch, A., Jefferson, C., Miguel, I.: Constraints for breaking more row and column symmetries. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 318\u2013332. Springer, Heidelberg (2003)"},{"key":"11_CR13","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Proceedings ECAI 2006, pp. 98\u2013102 (2006)"},{"key":"11_CR14","unstructured":"Gent, I.P., Miguel, I., Rendl, A.: Common subexpression elimination in automated constraint modelling. In: Workshop on Modeling and Solving Problems with Constraints, pp. 24\u201330 (2008)"},{"key":"11_CR15","unstructured":"Gent, I.P., Walsh, T.: CSPlib: a benchmark library for constraints. Tech. rep. (April\u00a016, 1999), http:\/\/citeseer.ist.psu.edu\/5054.html , http:\/\/www.cs.strath.ac.uk\/~apes\/reports\/apes-09-1999.ps.gz"},{"issue":"1-2","key":"11_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00081-3","volume":"126","author":"C.P. Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence\u00a0126(1-2), 43\u201362 (2001)","journal-title":"Artificial Intelligence"},{"key":"11_CR17","unstructured":"Harvey, W.: Symmetry breaking and the social golfer problem. In: Proc. SymCon 2001: Symmetry in Constraints, co-located with CP 2001, pp. 9\u201316 (2001)"},{"issue":"2","key":"11_CR18","first-page":"131","volume":"16","author":"B. Hnich","year":"2003","unstructured":"Hnich, B.: Thesis: Function variables for constraint programming. AI Commun.\u00a016(2), 131\u2013132 (2003)","journal-title":"AI Commun."},{"issue":"5296","key":"11_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"275","author":"B.A. Huberman","year":"1997","unstructured":"Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science\u00a0275(5296), 51\u201354 (1997)","journal-title":"Science"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-04244-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"S. Huczynska","year":"2009","unstructured":"Huczynska, S., McKay, P., Miguel, I., Nightingale, P.: Modelling equidistant frequency permutation arrays: An application of constraints to mathematics. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 50\u201364. Springer, Heidelberg (2009)"},{"key":"11_CR21","unstructured":"Koninck, L.D., Brand, S., Stuckey, P.J.: Data independent type reduction for zinc. In: ModRef 2010 (2010)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), vol.\u00a01, pp. 45\u201352 (2010)","DOI":"10.1109\/ICTAI.2010.16"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1007\/978-3-540-45193-8_107","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J. Little","year":"2003","unstructured":"Little, J., Gebruers, C., Bridge, D.G., Freuder, E.C.: Using case-based reasoning to write constraint programs. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 983\u2013983. Springer, Heidelberg (2003)"},{"key":"11_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11527862_12","volume-title":"Abstraction, Reformulation and Approximation","author":"T. Mancini","year":"2005","unstructured":"Mancini, T., Cadoli, M.: Detecting and breaking symmetries by reasoning on problem specifications. In: Zucker, J.-D., Saitta, L. (eds.) SARA 2005. LNCS (LNAI), vol.\u00a03607, pp. 165\u2013181. Springer, Heidelberg (2005)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P.J., de la Banda, M.G., Wallace, M.: The design of the zinc modelling language. Constraints\u00a013(3) (2008), http:\/\/dx.doi.org\/10.1007\/s10601-008-9041-4","DOI":"10.1007\/s10601-008-9041-4"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-23786-7_45","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"C. Mears","year":"2011","unstructured":"Mears, C., Niven, T., Jackson, M., Wallace, M.: Proving symmetries by model transformation. In: Lee, J. (ed.) CP 2011. LNCS, vol.\u00a06876, pp. 591\u2013605. Springer, Heidelberg (2011)"},{"key":"11_CR27","unstructured":"Mills, P., Tsang, E., Williams, R., Ford, J., Borrett, J.: EaCL 1.5: An easy abstract constraint optimisation programming language. Tech. rep., University of Essex, Colchester, UK (December 1999)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N. Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 529\u2013543. Springer, Heidelberg (2007)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-540-30201-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"J.F. Puget","year":"2004","unstructured":"Puget, J.F.: Constraint programming next challenge: Simplicity of use. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 5\u20138. Springer, Heidelberg (2004)"},{"key":"11_CR30","unstructured":"Rendl, A.: Thesis: Effective Compilation of Constraint Models. Ph.D. thesis, University of St. Andrews (2010)"},{"key":"11_CR31","unstructured":"Smith, B.M.: Search strategies for optimization: Modelling the sonet problem. Tech. Rep. Research Report APES-70-2003. presented at 2nd International Workshop on Reformulating Constraint Satisfaction Problems (2003)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-60299-2_3","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"B.M. Smith","year":"1995","unstructured":"Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The progressive party problem: Integer linear programming and constraint programming compared. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 36\u201352. Springer, Heidelberg (1995)"},{"key":"11_CR33","volume-title":"The OPL Optimization Programming Language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T11:09:42Z","timestamp":1688468982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40627-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406263","9783642406270"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40627-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}