{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:48Z","timestamp":1742617128444,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:39:11Z","timestamp":1330288751000},"page":"95-109","source":"Crossref","is-referenced-by-count":1,"title":["Incremental learning of logic programs"],"prefix":"10.1007","author":[{"given":"M. R. K. Krishna","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","first-page":"114","volume":"761","author":"G. Aguzzi","year":"1993","unstructured":"G. Aguzzi and U. Modigliani (1993), Proving termination of logic programs by transforming them into equivalent term rewriting systems, Proc. of FST&TCS'93, LNCS 761, pp. 114\u2013124.","journal-title":"LNCS"},{"key":"7_CR2","first-page":"405","volume":"E75-D","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara and A. Yamamoto (1992), Algorithmic learning theory and elementary formal systems, IEICE Trans. Inf. & Sys. E75-D, pp. 405\u2013414.","journal-title":"IEICE Trans. Inf. & Sys."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler and M.K. Warmuth (1989), Learnability and Vapnik-Chervonenkis dimension, JACM 36, pp. 929\u2013965.","journal-title":"JACM"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P.G. Bosco","year":"1988","unstructured":"P.G. Bosco, E. Giovannetti and C. Moiso (1988), Narrowing vs. SLD-resolution, Theoretical Computer Science 59, pp. 3\u201323.","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"S. Dzeroski, S. Muggleton and S. Russel (1992), PAC-learnability of determinate logic programs, Proc. of COLT'92, pp. 128\u2013135.","DOI":"10.1145\/130385.130399"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\/20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus (1994), The integration of functions into logic programming: a survey, J. Logic Prog. 19\/20, pp. 583\u2013628.","journal-title":"J. Logic Prog."},{"key":"7_CR7","first-page":"318","volume":"87","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot (1980), Canonical forms and unification, Proc. of CADE'80, LNCS 87, pp. 318\u2013334.","journal-title":"LNCS"},{"key":"7_CR8","first-page":"63","volume":"743","author":"K. Ito","year":"1992","unstructured":"K. Ito and A. Yamamoto (1992), Polynomial-time MAT learning of multilinear logic programs, Proc. of ALT'92, LNAI 743, pp. 63\u201374.","journal-title":"LNAI"},{"key":"7_CR9","first-page":"213","volume":"626","author":"M. K. Rao","year":"1991","unstructured":"M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1991), A Transformational methodology for proving termination of logic programs, Proc. of CSL'91, LNCS 626, pp. 213\u2013226.","journal-title":"LNCS"},{"key":"7_CR10","unstructured":"M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1993), Proving termination of GHC programs, Proc. of ICLP'93, pp. 720\u2013736."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"7_CR12","unstructured":"S. Miyano, A. Shinohara and T. Shinohara (1991), Which classes of elementary formal systems are polynomial-time learnable?, Proc. of ALT'91, pp. 139\u2013150."},{"key":"7_CR13","unstructured":"S. Miyano, A. Shinohara and T. Shinohara (1993), Learning elementary formal systems and an application to discovering motifs in proteins, Tech. Rep. RIFIS-TR-CS-37, RIFIS, Kyushu University."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt (1994), Inductive logic programming: theory and methods, J. Logic Prog. 19\/20, pp. 629\u2013679.","journal-title":"J. Logic Prog."},{"key":"7_CR15","unstructured":"B.K. Natarajan (1991), Machine Learning: A Theoretical Approach, Morgan-Kaufmann."},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037452","volume":"7","author":"Y. Sakakibara","year":"1990","unstructured":"Y. Sakakibara (1990), Inductive inference of logic programs based on algebraic semantics, New Gen. Comp. 7, pp. 365\u2013380.","journal-title":"New Gen. Comp."},{"key":"7_CR17","unstructured":"E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.","DOI":"10.7551\/mitpress\/1192.001.0001"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"R.K. Shyamasundar, M.R.K. Krishna Rao and D. Kapur (1992), Rewriting concepts in the study of termination of logic Programs, Proc. of ALPUK'92 conf. (edited by K. Broda), Workshops in Computing series, pp. 3\u201320, Springer-Verlag.","DOI":"10.1007\/978-1-4471-3421-3_1"},{"key":"7_CR20","first-page":"111","volume":"744","author":"A. Yamamoto","year":"1993","unstructured":"A. Yamamoto (1993), Generalized unification as background knowledge in learning logic programs, Proc. of ALT'93, LNAI 744, pp. 111\u2013122. Revised version appears as Learning logic programs using definite equality theories as background knowledge, IEICE Trans. Inf. & Syst. E78-D, May 1995, pp. 539\u2013544.","journal-title":"Proc. of ALT'93, LNAI"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:04:26Z","timestamp":1742598266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}