ML Anthology

BMWk Revisited - Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences

Guillaume Le Blanc
ECML-PKDD 1994 pp. 183-197
doi:10.1007/3-540-57868-4_58 /ecmlpkdd/1994/blanc1994ecml-bmwk/

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.

PDF ECML-PKDD Semantic Scholar

Cite

Text

Le Blanc. "BMWk Revisited - Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences." European Conference on Machine Learning, 1994. doi:10.1007/3-540-57868-4_58

Markdown

[Le Blanc. "BMWk Revisited - Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences." European Conference on Machine Learning, 1994.](https://mlanthology.org/ecmlpkdd/1994/blanc1994ecml-bmwk/) doi:10.1007/3-540-57868-4_58

BibTeX

@inproceedings{blanc1994ecml-bmwk,
  title     = {{BMWk Revisited - Generalization and Formalization of an Algorithm for Detecting Recursive Relations in Term Sequences}},
  author    = {Le Blanc, Guillaume},
  booktitle = {European Conference on Machine Learning},
  year      = {1994},
  pages     = {183-197},
  doi       = {10.1007/3-540-57868-4_58},
  url       = {https://mlanthology.org/ecmlpkdd/1994/blanc1994ecml-bmwk/}
}