Incremental Learning of Logic Programs
Abstract
In this paper, we identify a class of polynomial-time learnable logic programs. These programs can be learned from examples in an incremental fashion using the already defined predicates as background knowledge. Our class properly contains the class of innermost simple programs of [20] and the class of hereditary programs of [12,13]. Standard programs for multiplication, quick-sort, reverse and merge are a few examples of programs that can be handled by our results but not by the earlier results of [12, 13, 20].
Cite
Text
Rao. "Incremental Learning of Logic Programs." International Conference on Algorithmic Learning Theory, 1995. doi:10.1007/3-540-60454-5_31Markdown
[Rao. "Incremental Learning of Logic Programs." International Conference on Algorithmic Learning Theory, 1995.](https://mlanthology.org/alt/1995/rao1995alt-incremental/) doi:10.1007/3-540-60454-5_31BibTeX
@inproceedings{rao1995alt-incremental,
title = {{Incremental Learning of Logic Programs}},
author = {Rao, M. R. K. Krishna},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1995},
pages = {95-109},
doi = {10.1007/3-540-60454-5_31},
url = {https://mlanthology.org/alt/1995/rao1995alt-incremental/}
}