Abstract
In this paper, we study exact learning of logic programs from entailment queries and present a polynomial time algorithm to learn a rich class of logic programs that allow local variables and include many standard programs like addition, multiplication, exponentiation, member, prefix, suffix, length, append, merge, split, delete, insert, insertion-sort, quick-sort, merge-sort, preorder and inorder traversal of binary trees, polynomial recognition, derivatives, sum of a list of naturals. Our algorithm asks at most polynomial number of queries and our class is the largest of all the known classes of programs learnable from entailment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Learning with hints. In: Proc. COLT 1988, pp. 223–237 (1988)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Apt, K.R., Luitjes, I.: Verification of logic programs with delay declarations. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 66–90. Springer, Heidelberg (1995)
Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Li, M. (ed.) ALT 1997. LNCS (LNAI), vol. 1316, pp. 432–445. Springer, Heidelberg (1997)
Cohen, W., Hirsh, H.: Learnability of description logics. In: Proc. COLT 1992, pp. 116–127 (1992)
Dzeroski, S., Muggleton, S., Russel, S.: PAC-learnability of determinate logic programs. In: Proc. of COLT 1992, pp. 128–135 (1992)
Frazier, M., Pitt, L.: Learning from entailment: an application to propositional Horn sentences. In: Proc. ICML 1993, pp. 120–127 (1993)
Frazier, M., Pitt, L.: CLASSIC learning. In: Proc. COLT 1994, pp. 23–34 (1994)
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–205. IOS Press, Amsterdam (1996)
Krishna Rao, M.R.K.: Incremental learning of logic programs. Theoretical Computer Science 185, 193–213 (1998)
Krishna Rao, M.R.K.: Some classes of Prolog programs inferable from positive data. Theoretical Computer Science 241, 211–234 (2000)
Krishna Rao, M.R.K., Sattar, A.: Learning linearly-moded programs from entailment. In: Lee, H.-Y. (ed.) PRICAI 1998. LNCS (LNAI), vol. 1531, pp. 482–493. Springer, Heidelberg (1998)
Krishna Rao, M.R.K., Sattar, A.: Polynomial-time earnability of logic programs with local variables from entailment. Theoretical Computer Science 268, 179–198 (2001)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)
Muggleton, S., De Raedt, L.: Inductive logic programming: theory and methods. J. Logic Prog., 19–20, 629–679 (1994)
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)
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)
Page, C.D., Frish, A.M.: Generalization and learnability: a study of constrained atoms. In: Muggleton (ed.) Inductive Logic programming, pp. 29–61 (1992)
Reddy, C., Tadepalli, P.: Learning first order acyclic Horn programs from entailment. In: Proc. of Inductive Logic Programming, ILP 1998 (1998)
Rouveirol, C.: Extensions of inversion of resolution applied to theory completion. In: Muggleton (ed.) Inductive Logic programming, pp. 63–92 (1992)
Shapiro, E.: Inductive inference of theories from facts, Tech. Rep., Yale Univ (1981)
Shapiro, E.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)
Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, M.R.K.K. (2004). Learnability of Simply-Moded Logic Programs from Entailment. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30502-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24087-7
Online ISBN: 978-3-540-30502-6
eBook Packages: Computer ScienceComputer Science (R0)