Abstract
We present a polynomial time algorithm to learn a rich class of logic programs (called one-recursive programs) from positive examples alone. This class of programs uses the divide-and-conquer methodology and contains a wide range of programs such as append, reverse, merge, split, delete, insertion-sort, preorder and inorder traversal of binary trees, polynomial recognition, derivatives, sum of a list of numbers and allows local variables.
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
References
H. Arimura, H. Ishizaka and T. Shinohara (1992), Polynomial time inference of a subclass of context-free transformations, Proc. of COLT’92, pp. 136–143.
E.M. Gold (1967), Language identification in the limit, Information and Control 10, pp. 447–474.
M.R.K. Krishna Rao (1996), A class of Prolog programs inferable from positive data, Proc. of ALT’96, Lecture Notes in Computer Science 1160, pp. 272–84.
M.R.K. Krishna Rao and A. Sattar (1999), Learning logic programs with local variables from positive examples, Technical Report, Griffith University.
L. Sterling and E. Shapiro (1994), The Art of Prolog, MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishna Rao, M.R.K., Sattar, A. (1999). Learning Logic Programs with Local Variables from Positive Examples. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_41
Download citation
DOI: https://doi.org/10.1007/3-540-46695-9_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66822-0
Online ISBN: 978-3-540-46695-6
eBook Packages: Springer Book Archive