A class of prolog programs inferable from positive data
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 . 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 . The generality of our results follows from the fact that we treat logical variables as transmitters for broadcasting communication, whereas Arimura and Shinohara  treat them as point-to-point communication channels.
KeywordsLogic Program Logic Programming Inductive Inference Regular Language Positive Data
Unable to display preview. Download preview PDF.
- 3.H. Arimura (1993), Depth-bounded inference for nonterminating Prologs, Bulletin of Informatics and Cybernetics 25, pp. 125–136.Google Scholar
- 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
- 6.J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.Google Scholar
- 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.E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ.Google Scholar
- 10.E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.Google Scholar
- 11.T. Shinohara (1991), Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, pp. 371–384.Google Scholar
- 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