A class of prolog programs inferable from positive data

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


In this paper, we identify a class of Prolog programs inferable from positive data. Our approach is based on moding information and linear predicate inequalities between input terms and output terms. Our results generalize the results of Arimura and Shinohara [4]. Standard programs for reverse, quick-sort, merge-sort are a few examples of programs that can be handled by our results but not by the earlier results of [4]. The generality of our results follows from the fact that we treat logical variables as transmitters for broadcasting communication, whereas Arimura and Shinohara [4] treat them as point-to-point communication channels.


Logic Program Logic Programming Inductive Inference Regular Language Positive Data 
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 (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117–135.CrossRefGoogle Scholar
  2. 2.
    K.R. Apt and D. Pedreschi (1993), Reasoning about termination of pure Prolog programs, Information and Computation 106, pp. 109–157.CrossRefGoogle Scholar
  3. 3.
    H. Arimura (1993), Depth-bounded inference for nonterminating Prologs, Bulletin of Informatics and Cybernetics 25, pp. 125–136.Google Scholar
  4. 4.
    H. Arimura and T. Shinohara (1994), Inductive inference of Prolog programs with linear data dependency from positive data, Proc. Information Modelling and Knowledge Bases V, pp. 365–375, IOS press.Google Scholar
  5. 5.
    E.M. Gold (1967), Language identification in the limit, Information and Control 10, pp. 447–474.CrossRefGoogle Scholar
  6. 6.
    J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.Google Scholar
  7. 7.
    S. Muggleton and L. De Raedt (1994), Inductive logic programming: theory and methods, J. Logic Prog. 19/20, pp. 629–679.CrossRefGoogle Scholar
  8. 8.
    L. Plümer(1990), Termination proofs for logic programs, Ph. D. thesis, University of Dortmund, Also appears as Lecture Notes in Computer Science 446, Springer-Verlag.Google Scholar
  9. 9.
    E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ.Google Scholar
  10. 10.
    E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.Google Scholar
  11. 11.
    T. Shinohara (1991), Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, pp. 371–384.Google Scholar
  12. 12.
    J.D. Ullman and A. van Gelder (1988), Efficient tests for top-Down termination of logical rules, JACM 35, pp. 345–373.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • M. R. K. Krishna Rao
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations