Learning in the Limit in a Growing Language
Abstract
This paper describes the design of an algorithm which learns a class of theories in the limit in a sublanguage of afirst order language. The languages chosen are richer than those handled previously - needing a more efficient search through the version space. The language is not initially known to the system, but is learned together with the theory.
Cite
Text
Banerji. "Learning in the Limit in a Growing Language." International Joint Conference on Artificial Intelligence, 1987.Markdown
[Banerji. "Learning in the Limit in a Growing Language." International Joint Conference on Artificial Intelligence, 1987.](https://mlanthology.org/ijcai/1987/banerji1987ijcai-learning/)BibTeX
@inproceedings{banerji1987ijcai-learning,
title = {{Learning in the Limit in a Growing Language}},
author = {Banerji, Ranan B.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1987},
pages = {280-282},
url = {https://mlanthology.org/ijcai/1987/banerji1987ijcai-learning/}
}