Learning from Entailment of Logic Programs with Local Variables

  • M. R. K. Krishna Rao
  • A. Sattar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1501)


In this paper, we study exact learning of logic programs from entailment and present a polynomial time algorithm to learn a rich class of logic programs that allow local variables and include many standard programs like append, merge, split, delete, member, prefix, suffix, length, reverse, append/4 on lists, tree traversal programs on binary trees and addition, multiplication, exponentiation on natural numbers. Grafting a few aspects of incremental learning [9] onto the framework of learning from entailment [3], we generalize the existing results to allow local variables, which play an important role of sideways information passing in the paradigm of logic programming.


Polynomial Time Logic Program Logic Programming Target Program Polynomial Time Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Angluin (1988), Learning with hints, Proc. COLT’88, pp. 223–237.Google Scholar
  2. 2.
    D. Angluin (1988), Queries and concept learning, Machine Learning 2, pp. 319–342.Google Scholar
  3. 3.
    H. Arimura (1997), Learning acyclic first-order Horn sentences from entailment, Proc. ALT’97, Lecture Notes in Artificial intelligence 1316, pp. 432–445.Google Scholar
  4. 4.
    W. Cohen and H. Hirsh (1992), Learnability of description logics, Proc. COLT’92, pp. 116–127.Google Scholar
  5. 5.
    S. Dzeroski, S. Muggleton and S. Russel (1992), PAC-learnability of determinate logic programs, Proc. of COLT’92, pp. 128–135.Google Scholar
  6. 6.
    M. Frazier and L. Pitt (1993), Learning from entailment: an application to propositional Horn sentences, Proc. ICML’93, pp. 120–127.Google Scholar
  7. 7.
    M. Frazier and L. Pitt (1994), CLASSIC learning, Proc. COLT’94, pp. 23–34.Google Scholar
  8. 8.
    P. Idestam-Almquist (1996), Efficient induction of recursive definitions by structural analysis of saturations, pp. 192–205 in L. De Raedt (ed.), Advances in inductive logic programming, IOS Press.Google Scholar
  9. 9.
    M.R.K. Krishna Rao (1995), Incremental Learning of Logic Programs, Proc. of Algorithmic Learning Theory, ALT’95, LNCS 997, pp. 95–109. Revised version in Theoretical Computer Science special issue on ALT’95, Vol 185, 193–213.Google Scholar
  10. 10.
    J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.Google Scholar
  11. 11.
    S. Muggleton and L. De Raedt (1994), Inductive logic programming: theory and methods, J. Logic Prog. 19/20, pp. 629–679.CrossRefGoogle Scholar
  12. 12.
    S.H. Nienhuys-Cheng and R. de Wolf (1995), The subsumption theorem for several forms of resolution, Tech. Rep. EUR-FEW-CS-96-14, Erasmus University, Rotterdam.Google Scholar
  13. 13.
    C.D. Page and A.M. Frish (1992), Generalization and learnability: a study of constrained atoms, in Muggleton (ed.) Inductive Logic programming, pp. 29–61.Google Scholar
  14. 14.
    C. Reddy and P. Tadepalli (1998), Learning first order acyclic Horn programs from entailment, to appear in Proc. of International Conference on Machine Learning, ICML’98.Google Scholar
  15. 15.
    C. Rouveirol (1992), Extensions of inversion of resolution applied to theory completion, in Muggleton (ed.) Inductive Logic programming, pp. 63–92.Google Scholar
  16. 16.
    E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ.Google Scholar
  17. 17.
    E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.Google Scholar
  18. 18.
    L. Sterling and E. Shapiro (1994), The Art of Prolog, MIT Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • M. R. K. Krishna Rao
    • 1
  • A. Sattar
    • 1
  1. 1.School of Computing and Information Technology Faculty of Information and Communication TechnologyGriffith UniversityAustralia

Personalised recommendations