{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:02:38Z","timestamp":1725829358058},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319243085"},{"type":"electronic","value":"9783319243092"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24309-2_22","type":"book-chapter","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T06:21:33Z","timestamp":1441693293000},"page":"288-300","source":"Crossref","is-referenced-by-count":1,"title":["Empowered Negative Specialization in Inductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Ferilli","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Pazienza","sequence":"additional","affiliation":[]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83952-8","volume-title":"Logic Programming and Databases","author":"S Ceri","year":"1990","unstructured":"Ceri, S., Gottl\u00f6b, G., Tanca, L.: Logic Programming and Databases. Springer-Verlag, Heidelberg (1990)"},{"issue":"1\u20132","key":"22_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"VS Costa","year":"2012","unstructured":"Costa, V.S., Rocha, R., Damas, L.: The YAP Prolog system. Theory and Practice of Logic Programming 12(1\u20132), 5\u201334 (2012)","journal-title":"Theory and Practice of Logic Programming"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-61286-6_171","volume-title":"Foundations of Intelligent Systems","author":"F Esposito","year":"1996","unstructured":"Esposito, F., Laterza, A., Malerba, D., Semeraro, G.: Locally finite, proper and complete operators for refining datalog programs. In: Michalewicz, M., Ra\u015b, Z.W. (eds.) ISMIS 1996. LNCS, vol. 1079, pp. 468\u2013478. Springer, Heidelberg (1996)"},{"issue":"1\/2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1007638124237","volume":"38","author":"F Esposito","year":"2000","unstructured":"Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy Theory Revision: Induction and Abduction in INTHELEX. Machine Learning Journal 38(1\/2), 133\u2013156 (2000)","journal-title":"Machine Learning Journal"},{"key":"22_CR5","unstructured":"Ferilli, S.: Toward an improved downward refinement operator for inductive logic programming. In: Atti del 11th Italian Convention on Computational Logic (CILC-2014), vol. 1195, pp. 99\u2013113. Central Europe (CEUR) Workshop Proceedings (2014)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C.: Elements of relational database theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Formal Models and Semantics, vol. B, pp. 1073\u20131156. Elsevier Science Publishers (1990)","DOI":"10.1016\/B978-0-444-88074-1.50022-6"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-58495-1_32","volume-title":"Methodologies for Intelligent Systems","author":"J Komorowski","year":"1994","unstructured":"Komorowski, J., Trcek, S.: Towards refinement of definite logic programs. In: Ra\u015b, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 315\u2013325. Springer, Heidelberg (1994)"},{"key":"22_CR8","unstructured":"Laird, P.D.: Inductive inference by refinement. In: Proc. of AAAI-1986, Philadelphia, PA, pp. 472\u2013476 (1986)"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer-Verlag, Berlin (1987)","edition":"2"},{"key":"22_CR10","first-page":"82","volume-title":"Advances in Inductive Logic Programming","author":"C N\u00e9dellec","year":"1996","unstructured":"N\u00e9dellec, C., Rouveirol, C., Ad\u00e9, H., Bergadano, F., Tausend, B.: Declarative bias in ILP. In: de Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 82\u2013103. IOS Press, Amsterdam, NL (1996)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/322186.322189","volume":"27","author":"R Reiter","year":"1980","unstructured":"Reiter, R.: Equality and domain closure in first order databases. Journal of the ACM 27, 235\u2013249 (1980)","journal-title":"Journal of the ACM"},{"key":"22_CR12","unstructured":"Rouveirol, C.: Extensions of inversion of resolution applied to theory completion. In: Inductive Logic Programming, pp. 64\u201390. Academic Press (1992)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-60939-3_9","volume-title":"Logic Program Synthesis and Transformation","author":"G Semeraro","year":"1996","unstructured":"Semeraro, G., Esposito, F., Malerba, D.: Ideal refinement of datalog programs. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 120\u2013136. Springer, Heidelberg (1996)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-49674-2_16","volume-title":"Logic Program Synthesis and Transformation","author":"G Semeraro","year":"1998","unstructured":"Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incremental inductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol. 1463, pp. 300\u2013321. Springer, Heidelberg (1998)"},{"key":"22_CR15","unstructured":"Shapiro, E.Y.: Inductive inference of theories from facts. Technical Report Research Report 192, Yale University (1981)"},{"key":"22_CR16","unstructured":"Siekmann, J.H.: An introduction to unification theory. In: Banerji, R.B. (ed.) Formal Techniques in Artificial Intelligence - A Sourcebook, pp. 460\u2013464. Elsevier Science Publisher (1990)"},{"issue":"1\u20132","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(97)00055-6","volume":"98","author":"NL Tinkham","year":"1998","unstructured":"Tinkham, N.L.: Schema induction for logic program synthesis. Artif. Intell. 98(1\u20132), 1\u201347 (1998)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","AI*IA 2015 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24309-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:03:01Z","timestamp":1559253781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24309-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319243085","9783319243092"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24309-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}