Polynomial time inference of a subclass of context-free transformations
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
A Class of Prolog Programs Inferable from Positive Data
ALT '96 Proceedings of the 7th International Workshop on Algorithmic Learning Theory
| Hi-index | 0.00 |
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.