{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:06:19Z","timestamp":1767337579369,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","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":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_4","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"77-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["ModelSeeker: Extracting Global Constraint Models from Positive Examples"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Simonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"4_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). doi:10.1007\/978-3-642-40627-0_11"},{"key":"4_CR2","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.: Global constraint catalog, 2nd edn. (revision a). Technical report T2012:03, SICS (2012)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-23786-7_4","volume-title":"CP 2011","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 12\u201326. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23786-7_4"},{"key":"4_CR4","unstructured":"Beldiceanu, N., Simonis, H.: Using the global constraint seeker for learning structured constraint models: a first attempt. In: The 10th International Workshop on Constraint Modelling and Reformulation (ModRef 2011), Perugia, Italy, pp. 20\u201334, September 2011"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s10601-015-9200-3","volume":"21","author":"N Beldiceanu","year":"2016","unstructured":"Beldiceanu, N., Carlsson, M., Douence, R., Simonis, H.: Using finite transducers for describing and synthesising structural time-series constraints. Constraints 21(1), 22\u201340 (2016)","journal-title":"Constraints"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-012-9132-0","volume":"18","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On the reification of global constraints. Constraints 18(1), 1\u20136 (2013)","journal-title":"Constraints"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-642-40627-0_54","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Ifrim, G., Lenoir, A., Simonis, H.: Describing and generating solutions for the EDF unit commitment problem with the ModelSeeker. In: Schulte, C. (ed.) Principles and Practice of Constraint Programming. LNCS, vol. 8124, pp. 733\u2013748. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40627-0_54"},{"key":"4_CR8","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. Lecture Notes in Computer Science, vol. 7514, pp. 141\u2013157. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33558-7_13"},{"key":"4_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/9780429487309","volume-title":"Winning Ways for Your Mathematical Plays","author":"ER Berlekamp","year":"2004","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, vol. 4, 2nd edn. A K Peters\/CRC Press, Natick (2004)","edition":"2"},{"key":"4_CR10","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":"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. 3258, pp. 123\u2013137. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30201-8_12"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11564096_8","volume-title":"Machine Learning: ECML 2005","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., Coletta, R., Koriche, F., O\u2019Sullivan, B.: A SAT-based version space algorithm for acquiring constraint satisfaction problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 23\u201334. Springer, Heidelberg (2005). doi:10.1007\/11564096_8"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/11564751_57","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., Coletta, R., Petit, T.: Acquiring parameters of implied global constraints. In: Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 747\u2013751. Springer, Heidelberg (2005). doi:10.1007\/11564751_57"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.4153\/CJM-1960-016-5","volume":"12","author":"RC Bose","year":"1960","unstructured":"Bose, R.C., Shrikhande, S.S., Parker, E.T.: Further results on the construction of mutually orthogonal latin squares and the falsity of Euler\u2019s conjecture. Can. J. Math. 12, 189\u2013203 (1960)","journal-title":"Can. J. Math."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An algorithm for solving the job shop problem. Manag. Sci. 35, 164\u2013176 (1989)","journal-title":"Manag. Sci."},{"key":"4_CR15","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"73","volume-title":"ECAI","author":"J Charnley","year":"2006","unstructured":"Charnley, J., Colton, S., Miguel, I.: Automatic generation of implied constraints. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI. Frontiers in Artificial Intelligence and Applications, vol. 141, pp. 73\u201377. IOS Press, Amsterdam (2006)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/JAM\/2006\/26385","volume":"2006","author":"K Drakakis","year":"2006","unstructured":"Drakakis, K.: A review of Costas arrays. J. Appl. Math. 2006, 1\u201332 (2006)","journal-title":"J. Appl. Math."},{"key":"4_CR17","volume-title":"Amusements in Mathematics","author":"HE Dudeney","year":"1917","unstructured":"Dudeney, H.E.: Amusements in Mathematics. Dover, New York (1917)"},{"key":"4_CR18","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling. Technical report 2001\u2013023, Department of Information Technology, Uppsala University, September 2001"},{"key":"4_CR19","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)"},{"key":"4_CR20","volume-title":"Constraint-Based Local Search","author":"P Van Hentenryck","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Boston (2005)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.49.1.163.11193","volume":"49","author":"M Henz","year":"2001","unstructured":"Henz, M.: Scheduling a major college basketball conference - revisited. Oper. Res. 49, 163\u2013168 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/S0377-2217(03)00101-2","volume":"153","author":"M Henz","year":"2004","unstructured":"Henz, M., M\u00fcller, T., Thiel, S.: Global constraints for round robin tournament scheduling. Eur. J. Oper. Res. 153(1), 92\u2013101 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR23","unstructured":"Hern\u00e1ndez, B.M.: The systematic generation of channelled models in constraint satisfaction. PhD thesis, University of York, York, YO10 5DD, UK, Department of Computer Science (2007)"},{"key":"4_CR24","volume-title":"Integrated Methods for Optimization","author":"JN Hooker","year":"2007","unstructured":"Hooker, J.N.: Integrated Methods for Optimization. Springer Science + Business Media LLC, New York (2007)"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: ICTAI, vol. 1, pp. 45\u201352. IEEE Computer Society (2010)","DOI":"10.1109\/ICTAI.2010.16"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-40627-0_34","volume-title":"Principles and Practice of Constraint Programming","author":"K Leo","year":"2013","unstructured":"Leo, K., Mears, C., Tack, G., Garcia de la Banda, M.: Globalizing constraint models. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 432\u2013447. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40627-0_34"},{"key":"4_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-01929-6_13","volume-title":"International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR\u201909)","author":"MJ Maher","year":"2009","unstructured":"Maher, M.J.: Open constraints in a boundable world. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 163\u2013177. Springer, Heidelberg (2009)"},{"issue":"3","key":"4_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10601-008-9041-4","volume":"13","author":"K Marriott","year":"2008","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), 229\u2013267 (2008)","journal-title":"Constraints"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G Nemhauser","year":"1998","unstructured":"Nemhauser, G., Trick, M.: Scheduling a major college basketball conference. Oper. Res. 46, 1\u20138 (1998)","journal-title":"Oper. Res."},{"key":"4_CR30","first-page":"1493","volume-title":"AAAI","author":"B O\u2019Sullivan","year":"2010","unstructured":"O\u2019Sullivan, B.: Automated modelling and solving in constraint programming. In: Fox, M., Poole, D. (eds.) AAAI, pp. 1493\u20131497. AAAI Press, Palo Alto (2010)"},{"key":"4_CR31","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/063","volume-title":"Famous Puzzles of Great Mathematicians","author":"MS Petkovic","year":"2009","unstructured":"Petkovic, M.S.: Famous Puzzles of Great Mathematicians. American Mathematical Society, Providence (2009)"},{"key":"4_CR32","unstructured":"Razakarison, N., Carlsson, M., Beldiceanu, N., Simonis, H.: GAC for a linear inequality and an atleast constraint with an application to learning simple polynomials. In: Helmert, M., R\u00f6ger, G. (eds.) Proceedings of the Sixth Annual Symposium on Combinatorial Search, SOCS 2013, Leavenworth, Washington, USA, 11\u201313 July 2013. AAAI Press (2013)"},{"key":"4_CR33","unstructured":"Roussel, O., Lecoutre, C.: XML representation of constraint networks format XCSP 2.1. Technical report arXiv:0902.2362v1, Universite Lille-Nord de France, Artois (2009)"},{"issue":"3","key":"4_CR34","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0166-218X(92)90252-6","volume":"35","author":"JAM Schreuder","year":"1992","unstructured":"Schreuder, J.A.M.: Combinatorial aspects of construction of competition Dutch professional football leagues. Discret. Appl. Math. 35(3), 301\u2013312 (1992)","journal-title":"Discret. Appl. Math."},{"issue":"1\/2","key":"4_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF00143880","volume":"1","author":"BM Smith","year":"1996","unstructured":"Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The progressive party problem: integer linear programming and constraint programming compared. Constraints 1(1\/2), 119\u2013138 (1996)","journal-title":"Constraints"},{"key":"4_CR36","unstructured":"Walser, J.P.: Domain-independent local search for linear integer optimization. PhD thesis, Technical Faculty of the University des Saarlandes, Saarbruecken, Germany, October 1998"},{"key":"4_CR37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400840922","volume-title":"Across the Board: The Mathematics of Chessboard Problems","author":"JJ Watkins","year":"2004","unstructured":"Watkins, J.J.: Across the Board: The Mathematics of Chessboard Problems. Princeton University Press, Princeton (2004)"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:13:03Z","timestamp":1709820783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}