Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Inductive inference of monotonic formal systems from positive data
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Reasoning about termination of pure Prolog programs
Information and Computation
Inductive inference of unbounded unions of pattern languages from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Some classes of Prolog programs inferable from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Algorithmic Program DeBugging
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs
SAS '95 Proceedings of the Second International Symposium on Static Analysis
On Sufficient Conditions for Learnability of Logic Programs from Positive Data
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we study inferability of Prolog programs from positive examples alone. We define a class of Prolog programs called recursion bounded programs that can capture non-linear relationships between inputs and outputs and yet inferable from positive examples. This class is rich enough to include many programs like append, delete, insert, reverse, permute, count, listsum, listproduct, insertion-sort, quick-sort on lists, various tree traversal programs and addition, multiplication, factorial, power on natural numbers. The relation between our results and the known results is also discussed. In particular, the class of recursion bounded programs contains all the known terminating linearly-moded Prolog programs of Krishna Rao [7] and additional programs like power on natural numbers which do not belong to the class of linearly-moded programs and the class of safe programs of Martin and Sharma [12].