{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:34Z","timestamp":1740894394390,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240877"},{"type":"electronic","value":"9783540305026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30502-6_9","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:22:20Z","timestamp":1294438940000},"page":"128-141","source":"Crossref","is-referenced-by-count":0,"title":["Learnability of Simply-Moded Logic Programs from Entailment"],"prefix":"10.1007","author":[{"given":"M. R. K. Krishna","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Angluin, D.: Learning with hints. In: Proc. COLT 1988, pp. 223\u2013237 (1988)"},{"key":"9_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-60043-4_47","volume-title":"Algebraic Methodology and Software Technology","author":"K.R. Apt","year":"1995","unstructured":"Apt, K.R., Luitjes, I.: Verification of logic programs with delay declarations. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol.\u00a0936, pp. 66\u201390. Springer, Heidelberg (1995)"},{"key":"9_CR4","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1997","unstructured":"Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol.\u00a01316, pp. 432\u2013445. Springer, Heidelberg (1997)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, W., Hirsh, H.: Learnability of description logics. In: Proc. COLT 1992, pp. 116\u2013127 (1992)","DOI":"10.1145\/130385.130398"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Dzeroski, S., Muggleton, S., Russel, S.: PAC-learnability of determinate logic programs. In: Proc. of COLT 1992, pp. 128\u2013135 (1992)","DOI":"10.1145\/130385.130399"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Frazier, M., Pitt, L.: Learning from entailment: an application to propositional Horn sentences. In: Proc. ICML 1993, pp. 120\u2013127 (1993)","DOI":"10.1016\/B978-1-55860-307-3.50022-8"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Frazier, M., Pitt, L.: CLASSIC learning. In: Proc. COLT 1994, pp. 23\u201334 (1994)","DOI":"10.1145\/180139.174994"},{"key":"9_CR9","first-page":"192","volume-title":"Advances in inductive logic programming","author":"P. Idestam-Almquist","year":"1996","unstructured":"Idestam-Almquist, P.: Efficient induction of recursive definitions by structural analysis of saturations. In: De Raedt, L. (ed.) Advances in inductive logic programming, pp. 192\u2013205. IOS Press, Amsterdam (1996)"},{"key":"9_CR10","first-page":"193","volume":"185","author":"M.R.K. Krishna Rao","year":"1998","unstructured":"Krishna Rao, M.R.K.: Incremental learning of logic programs. Theoretical Computer Science\u00a0185, 193\u2013213 (1998)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00271-6","volume":"241","author":"M.R.K. Krishna Rao","year":"2000","unstructured":"Krishna Rao, M.R.K.: Some classes of Prolog programs inferable from positive data. Theoretical Computer Science\u00a0241, 211\u2013234 (2000)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/BFb0095294","volume-title":"PRICAI\u201998: Topics in Artificial Intelligence","author":"M.R.K. Krishna Rao","year":"1998","unstructured":"Krishna Rao, M.R.K., Sattar, A.: Learning linearly-moded programs from entailment. In: Lee, H.-Y. (ed.) PRICAI 1998. LNCS (LNAI), vol.\u00a01531, pp. 482\u2013493. Springer, Heidelberg (1998)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(00)00270-X","volume":"268","author":"M.R.K. Krishna Rao","year":"2001","unstructured":"Krishna Rao, M.R.K., Sattar, A.: Polynomial-time earnability of logic programs with local variables from entailment. Theoretical Computer Science\u00a0268, 179\u2013198 (2001)","journal-title":"Theoretical Computer Science"},{"key":"9_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Muggleton, S., De Raedt, L.: Inductive logic programming: theory and methods. J. Logic Prog., 19\u201320, 629\u2013679 (1994)","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"9_CR16","unstructured":"Nienhuys-Cheng, S.H., de Wolf, R.: The subsumption theorem for several forms of resolution, Tech. Rep. EUR-FEW-CS-96-14, Erasmus Uni., Rotterdam (1995)"},{"key":"9_CR17","unstructured":"Page, C.D.: Anti-Unification in Constrained Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning and to Deduction, Ph.D. Thesis, Uni. of Illinois, Urbana (1993)"},{"key":"9_CR18","unstructured":"Page, C.D., Frish, A.M.: Generalization and learnability: a study of constrained atoms. In: Muggleton (ed.) Inductive Logic programming, pp. 29\u201361 (1992)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Reddy, C., Tadepalli, P.: Learning first order acyclic Horn programs from entailment. In: Proc. of Inductive Logic Programming, ILP 1998 (1998)","DOI":"10.1007\/BFb0027308"},{"key":"9_CR20","unstructured":"Rouveirol, C.: Extensions of inversion of resolution applied to theory completion. In: Muggleton (ed.) Inductive Logic programming, pp. 63\u201392 (1992)"},{"key":"9_CR21","unstructured":"Shapiro, E.: Inductive inference of theories from facts, Tech. Rep., Yale Univ (1981)"},{"key":"9_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"key":"9_CR23","volume-title":"The Art of Prolog","author":"L. Sterling","year":"1994","unstructured":"Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30502-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:41:42Z","timestamp":1740840102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30502-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240877","9783540305026"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30502-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}