Intensional Learning of Logic Programs
Abstract
In this paper we investigate the possibility of learning logic programs by using an intensional evaluation of clauses. Unlike learning methods based on extensionality, by adopting an intensional evaluation of clauses the learning algorithm presented in this paper is correct and sufficient and does not depend on the kind of examples provided. Since searching a space of possible programs (instead of a space of independent clauses) is unfeasible, only partial programs containing clauses successfully used to derive at least one positive example are taken into consideration. Since clauses are not learned independently of each others, backtracking may be required.
Cite
Text
Gunetti and Trinchero. "Intensional Learning of Logic Programs." European Conference on Machine Learning, 1994. doi:10.1007/3-540-57868-4_73Markdown
[Gunetti and Trinchero. "Intensional Learning of Logic Programs." European Conference on Machine Learning, 1994.](https://mlanthology.org/ecmlpkdd/1994/gunetti1994ecml-intensional/) doi:10.1007/3-540-57868-4_73BibTeX
@inproceedings{gunetti1994ecml-intensional,
title = {{Intensional Learning of Logic Programs}},
author = {Gunetti, Daniele and Trinchero, Umberto},
booktitle = {European Conference on Machine Learning},
year = {1994},
pages = {359-362},
doi = {10.1007/3-540-57868-4_73},
url = {https://mlanthology.org/ecmlpkdd/1994/gunetti1994ecml-intensional/}
}