Abstract
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.
On leave from Tata Institute of Fundamental Research, Bombay. The work was partially carried out at TIFR.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117–135.
K.R. Apt and D. Pedreschi (1993), Reasoning about termination of pure Prolog programs, Information and Computation 106, pp. 109–157.
H. Arimura (1993), Depth-bounded inference for nonterminating Prologs, Bulletin of Informatics and Cybernetics 25, pp. 125–136.
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.
E.M. Gold (1967), Language identification in the limit, Information and Control 10, pp. 447–474.
J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.
S. Muggleton and L. De Raedt (1994), Inductive logic programming: theory and methods, J. Logic Prog. 19/20, pp. 629–679.
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.
E. Shapiro (1981), Inductive inference of theories from facts, Tech. Rep., Yale Univ.
E. Shapiro (1983), Algorithmic Program Debugging, MIT Press.
T. Shinohara (1991), Inductive inference of monotonic formal systems from positive data, New Generation Computing 8, pp. 371–384.
J.D. Ullman and A. van Gelder (1988), Efficient tests for top-Down termination of logical rules, JACM 35, pp. 345–373.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishna Rao, M.R.K. (1996). A class of prolog programs inferable from positive data. In: Arikawa, S., Sharma, A.K. (eds) Algorithmic Learning Theory. ALT 1996. Lecture Notes in Computer Science, vol 1160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61863-5_52
Download citation
DOI: https://doi.org/10.1007/3-540-61863-5_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61863-8
Online ISBN: 978-3-540-70719-6
eBook Packages: Springer Book Archive