{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:23:46Z","timestamp":1750397026042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232188"},{"type":"electronic","value":"9783319232195"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23219-5_34","type":"book-chapter","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T10:17:33Z","timestamp":1439374653000},"page":"480-496","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Automatically Generating Streamlined Constraint Models with Essence and Conjure"],"prefix":"10.1007","author":[{"given":"James","family":"Wetter","sequence":"first","affiliation":[]},{"given":"\u00d6zg\u00fcr","family":"Akg\u00fcn","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,13]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-40627-0_11","volume-title":"Principles and Practice of Constraint Programming","author":"O Akgun","year":"2013","unstructured":"Akgun, O., Frisch, A.M., Gent, I.P., Hussain, B.S., Jefferson, C., Kotthoff, L., Miguel, I., Nightingale, P.: Automated symmetry breaking and model selection in Conjure. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 107\u2013116. Springer, Heidelberg (2013)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Akg\u00fcn, 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":"34_CR3","unstructured":"Ayel, J., Favaron, O.: Helms are graceful. Progress in Graph Theory (Waterloo, Ont., 1982), pp. 89\u201392. Academic Press, Toronto (1984)"},{"key":"34_CR4","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: ECAI, vol. 141, pp. 73\u201377 (2006)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Colton, S., Miguel, I.: Constraint generation via automated theory formation. In: Walsh, T. (ed.) Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, pp. 575\u2013579 (2001)","DOI":"10.1007\/3-540-45578-7_42"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Colton, S.: Automated Theory Formation in Pure Mathematics. Ph.D. thesis, University of Edinburgh (2001)","DOI":"10.1007\/978-1-4471-0147-5"},{"key":"34_CR7","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":"34_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM 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 13(3), 268\u2013306 (2008). doi:10.1007\/s10601-008-9047-y","journal-title":"Constraints"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1111\/j.1749-6632.1979.tb32792.x","volume":"319","author":"R Frucht","year":"1979","unstructured":"Frucht, R.: Graceful numbering of wheels and related graphs. Annals of the New York Academy of Sciences 319(1), 219\u2013229 (1979)","journal-title":"Annals of the New York Academy of Sciences"},{"key":"34_CR10","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: ECAI, vol. 141, pp. 98\u2013102 (2006)"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-30201-8_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C Gomes","year":"2004","unstructured":"Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274\u2013289. Springer, Heidelberg (2004)"},{"key":"34_CR12","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. 5732, pp. 50\u201364. Springer, Heidelberg (2009)"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11499107_11","volume-title":"Theory and Applications of Satisfiability Testing","author":"M Kouril","year":"2005","unstructured":"Kouril, M., Franco, J.: Resolution tunnels for improved SAT solver performance. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 143\u2013157. Springer, Heidelberg (2005)"},{"key":"34_CR14","unstructured":"Langford, C.D.: Problem. The Mathematical Gazette, 287\u2013287 (1958)"},{"key":"34_CR15","unstructured":"Le Bras, R., Gomes, C.P., Selman, B.: Double-wheel graphs are graceful. In: Proceedings of the Twenty-Third international Joint Conference on Artificial Intelligence, pp. 587\u2013593. AAAI Press (2013)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/978-3-319-10428-7_33","volume-title":"Principles and Practice of Constraint Programming","author":"R Le Bras","year":"2014","unstructured":"Le Bras, R., Gomes, C.P., Selman, B.: On the erd\u0151s discrepancy problem. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 440\u2013448. Springer, Heidelberg (2014)"},{"key":"34_CR17","first-page":"72","volume":"4","author":"K Ma","year":"1984","unstructured":"Ma, K., Feng, C.: On the gracefulness of gear graphs. Math. Practice Theory 4, 72\u201373 (1984)","journal-title":"Math. Practice Theory"},{"key":"34_CR18","doi-asserted-by":"publisher","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 13(3) (2008). doi:10.1007\/s10601-008-9041-4","DOI":"10.1007\/s10601-008-9041-4"},{"key":"34_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1007\/978-3-319-10428-7_43","volume-title":"Principles and Practice of Constraint Programming","author":"P Nightingale","year":"2014","unstructured":"Nightingale, P., Akg\u00fcn, \u00d6., Gent, I.P., Jefferson, C., Miguel, I.: Automatically improving constraint models in savile row through associative-commutative common subexpression elimination. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 590\u2013605. Springer, Heidelberg (2014)"},{"key":"34_CR20","unstructured":"Prestwich, S.: CSPLib problem 028: Balanced incomplete block designs. http:\/\/www.csplib.org\/Problems\/prob028"},{"key":"34_CR21","unstructured":"Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs Internat. Symposium, Rome, pp. 349\u2013355 (1966)"},{"key":"34_CR22","first-page":"114","volume":"25","author":"I Schur","year":"1916","unstructured":"Schur, I.: \u00dcber die kongruenz $$ x^m+ y^m \\equiv z^m ~(mod \\; p) $$. Jahresber. Deutsch. Math. Verein 25, 114\u2013117 (1916)","journal-title":"Jahresber. Deutsch. Math. Verein"},{"issue":"2","key":"34_CR23","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0898-1221(94)00219-B","volume":"29","author":"J Slaney","year":"1995","unstructured":"Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: Quasigroup existence problems. Computers & Mathematics with Applications 29(2), 115\u2013132 (1995)","journal-title":"Computers & Mathematics with Applications"},{"issue":"2","key":"34_CR24","first-page":"212","volume":"15","author":"BL Van der Waerden","year":"1927","unstructured":"Van der Waerden, B.L.: Beweis einer baudetschen vermutung. Nieuw Arch. Wisk 15(2), 212\u2013216 (1927)","journal-title":"Nieuw Arch. Wisk"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23219-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:01:58Z","timestamp":1676966518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23219-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232188","9783319232195"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23219-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"13 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}