Learning Logic Programs with Local Variables from Positive Examples
暂无分享,去创建一个
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.
[1] Leon Sterling,et al. The Art of Prolog , 1987, IEEE Expert.
[2] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..
[3] Hiroki Arimura,et al. Polynomial time inference of a subclass of context-free transformations , 1992, COLT '92.
[4] M. R. K. Krishna Rao. A Class of Prolog Programs Inferable from Positive Data , 1996, ALT.