Efficient Induction of Recursive Prolog Definitions
Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, volume 1081 of LNCS, page 240--248. Springer-Verlag, (1996)Abstract
The ability to learn recursive definitions is a desirable characteristic of a learner. This paper presents Clam, a system that efficiently learns Prolog purely and left-recursive definitions from small data sets by using inverse implication. A learning curve for Clam shows that the accuracy grows with the increase of both positive and negative examples. We believe our system can be used as a preprocessor for a general-purpose system when few examples are at hand.