Determinate Literals in Inductive Logic Programming
Abstract
A recent system, FOIL, constructs Horn clause programs from numerous examples. Computational efficiency is achieved by using greedy search guided by an information-based heuristic. Greedy search tends to be myopic but determinate terms, an adaptation of an idea introduced by another new system (GOLEM), has been found to provide many of the benefits of lookahead without substantial increases in computation. The efficacy of this approach is illustrated on the task of learning the quicksort procedure and other small but non-trivial list-manipulation functions.
Cite
Text
Quinlan. "Determinate Literals in Inductive Logic Programming." International Conference on Machine Learning, 1991. doi:10.1016/B978-1-55860-200-7.50091-XMarkdown
[Quinlan. "Determinate Literals in Inductive Logic Programming." International Conference on Machine Learning, 1991.](https://mlanthology.org/icml/1991/quinlan1991icml-determinate/) doi:10.1016/B978-1-55860-200-7.50091-XBibTeX
@inproceedings{quinlan1991icml-determinate,
title = {{Determinate Literals in Inductive Logic Programming}},
author = {Quinlan, J. Ross},
booktitle = {International Conference on Machine Learning},
year = {1991},
pages = {442-446},
doi = {10.1016/B978-1-55860-200-7.50091-X},
url = {https://mlanthology.org/icml/1991/quinlan1991icml-determinate/}
}