BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences

9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As several works in Machine Learning (particularly in Inductive Logic Programming) have focused on building recursive definitions from examples, this paper presents a formalization and a generalization of the BMWk methodology, which stems from program synthesis from examples, ten years ago. The framework of the proposed formalization is term rewriting. It allows to state some theoretical results on the qualities and limitations of the method.

Cite

CITATION STYLE

APA

Le Blanc, G. (1994). BMWk revisited generalization and formalization of an algorithm for detecting recursive relations in term sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 784 LNCS, pp. 183–197). Springer Verlag. https://doi.org/10.1007/3-540-57868-4_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free