{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T01:29:37Z","timestamp":1762738177670,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"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":"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":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_5","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"96-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Constraint Satisfaction Problems: An ILP Perspective"],"prefix":"10.1007","author":[{"given":"Luc","family":"De Raedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Dries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Bessiere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"issue":"2","key":"5_CR1","first-page":"283","volume":"11","author":"S Abdennadher","year":"2002","unstructured":"Abdennadher, S., Rigotti, C.: Automatic generation of rule-based solvers for intensionally defined constraints. IJAIT 11(2), 283\u2013302 (2002)","journal-title":"IJAIT"},{"issue":"4","key":"5_CR2","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"5_CR3","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X.: Global constraint catalog. http:\/\/www.emn.fr\/z-info\/sdemasse\/gccat\/"},{"key":"5_CR4","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":"Principles and Practice of Constraint Programming \u2013 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":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"CP 2012","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. 7514, pp. 141\u2013157. Springer, Heidelberg (2012)"},{"key":"5_CR6","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 Bessiere","year":"2004","unstructured":"Bessiere, 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":"5_CR7","unstructured":"Bessiere, C., Coletta, R., Hebrard, E., Katsirelos, G., Lazaar, N., Narodytska, N., Quimper, C.-G., Walsh, T.: Constraint acquisition via partial queries. In IJCAI, pp. 475\u2013481. AAAI Press (2013)"},{"key":"5_CR8","unstructured":"Bessiere, C., Coletta, R., O\u2019Sullivan, B., Paulin, M.: Query-driven constraint acquisition. In: IJCAI, pp. 50\u201355 (2007)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W Buntine","year":"1988","unstructured":"Buntine, W.: Generalized subsumption and its applications to induction and redundancy. Artif. Intell. 36(2), 149\u2013176 (1988)","journal-title":"Artif. Intell."},{"key":"5_CR10","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\u00e9re, 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. 2833, pp. 812\u2013816. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45193-8_58"},{"key":"5_CR11","unstructured":"De Raedt, L.: Induction in logic. In: Proceedings of the 3rd International Workshop on Multistrategy Learning, pp. 29\u201338 (1996)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and Relational Learning","author":"L De Raedt","year":"2008","unstructured":"De Raedt, L.: Logical and Relational Learning. Springer, Heidelberg (2008)"},{"key":"5_CR13","volume-title":"Encyclopidea of Machine Learning","author":"L De Raedt","year":"2010","unstructured":"De Raedt, L.: Inductive logic programming. In: Sammut, C., Webb, G.I. (eds.) Encyclopidea of Machine Learning. Springer, New York (2010)"},{"issue":"2\u20133","key":"5_CR14","first-page":"99","volume":"26","author":"L De Raedt","year":"1997","unstructured":"De Raedt, L., Dehaspe, L.: Clausal discovery. ML 26(2\u20133), 99\u2013146 (1997)","journal-title":"ML"},{"issue":"1\u20132","key":"5_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L De Raedt","year":"1994","unstructured":"De Raedt, L., D\u017eeroski, S.: First-order jk-clausal theories are PAC-learnable. Artif. Intell. 70(1\u20132), 375\u2013392 (1994)","journal-title":"Artif. Intell."},{"key":"5_CR16","first-page":"438","volume":"4","author":"L De Raedt","year":"2004","unstructured":"De Raedt, L., Ramon, J.: Condensed representations for inductive logic programming. KR 4, 438\u2013446 (2004)","journal-title":"KR"},{"issue":"1","key":"5_CR17","first-page":"7","volume":"4","author":"D Haussler","year":"1989","unstructured":"Haussler, D.: Learning conjunctive concepts in structural domains. Machine Learning 4(1), 7\u201340 (1989)","journal-title":"Machine Learning"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-56602-3_131","volume-title":"Machine Learning: ECML-93","author":"J-U Kietz","year":"1993","unstructured":"Kietz, J.-U.: Some lower bounds for the computational complexity of inductive logic programming. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 115\u2013123. Springer, Heidelberg (1993). doi:10.1007\/3-540-56602-3_131"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Lallouet, A., Lopez, M., Martin, L., Vrain, C.: On learning constraint problems. In: ICTAI, pp. 45\u201352 (2010)","DOI":"10.1109\/ICTAI.2010.16"},{"key":"5_CR20","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.) Principles and Practice of Constraint Programming. LNCS, vol. 8124, pp. 432\u2013447. Springer, Berlin Heidelberg (2013)"},{"key":"5_CR21","unstructured":"Mitchell, T.M.: Version spaces: a candidate elimination approach to rule learning. In: IJCAI, pp. 305\u2013310. Morgan Kaufmann Publishers Inc (1977)"},{"key":"5_CR22","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw Hill, New York (1997)"},{"key":"5_CR23","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.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74970-7_38"},{"key":"5_CR24","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: SOCS. AAAI Press (2013)"},{"key":"5_CR25","unstructured":"Smith, B.D., Rosenbloom, P.S.: Incremental non-backtracking focusing: a polynomially bounded generalization algorithm for version spaces. In: AAAI, pp. 848\u2013853. Citeseer (1990)"},{"key":"5_CR26","unstructured":"Srinivasan, A.: The aleph manual (2001).http:\/\/www.cs.ox.ac.uk\/activities\/machlearn\/Aleph\/aleph.html"},{"issue":"11","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"5_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S1471068411000445","volume":"12","author":"N-F Zhou","year":"2012","unstructured":"Zhou, N.-F.: The language features and architecture of B-Prolog. Theory Pract. Log. Program. 12(1\u20132), 189\u2013218 (2012)","journal-title":"Theory Pract. Log. Program."}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:10:29Z","timestamp":1709820629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_5","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"}}]}}