Abstract
FOIL is a learning system that constructs Horn clause programs from examples. This paper summarises the development of FOIL from 1989 up to early 1993 and evaluates its effectiveness on a non-trivial sequence of learning tasks taken from a Prolog programming text. Although many of these tasks are handled reasonably well, the experiment highlights some weaknesses of the current implementation. Areas for further research are identified.
Download to read the full chapter text
Chapter PDF
References
Bratko, I. (1986). Prolog Programming for Artificial Intelligence. Wokingham, UK: Addison-Wesley.
Breiman, L., Friedman, J.H., Olshen, R.A. and Stone, C.J. (1984). Classification and Regression Trees. Belmont: Wadsworth International.
Cameron-Jones, R.M., and Quinlan, J.R. (1993). Avoiding pitfalls when learning recursive theories (draft). Available by anonymous ftp from 129.78.8.1, file pub/recurse.tex.
Cestnik, B., Kononenko, I. and Bratko, I. (1987). ASSISTANT 86: a knowledge elicitation tool for sophisticated users. In Bratko and Lavrač (Eds.) Progress in Machine Learning. Wilmslow: Sigma Press.
Clark, P and Niblett, T. (1987). Induction in noisy domains. In Bratko and Lavrač (Eds.) Progress in Machine Learning. Wilmslow: Sigma Press.
Kietz, J. and Morik, K. (1993). A polynomial approach to the constructive induction of structural knowledge. Machine Learning, to appear.
Kijsirikul, B., Numao, M. and Shimura, M. (1991). Efficient learning of logic programs with non-determinate, non-discriminating literals. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 417–421.
Michalski, R.S., Mozetič, I., Hong, J. and Lavrač, N. (1986). The multipurpose incremental learning system AQ15 and its testing application to three medical domains. Proceedings Fifth National Conference on Artificial Intelligence, Philadelphia, 1041–1045.
Muggleton, S., and Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. Proceedings Fifth International Conference Machine Learning, Ann Arbor, 339–352.
Muggleton, S., and Feng, C. (1990). Efficient induction of logic programs. Proceedings First Conference on Algorithmic Learning Theory, Tokyo.
Pazzani, M.J., Brunk, C.A. and Silverstein, G. (1991). A knowledge-intensive approach to learning relational concepts. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 432–436.
Pazzani, M.J. and Kibler, D. (1992). The utility of knowledge in inductive learning. Machine Learning 9, 1, 57–94.
Quinlan, J.R. (1990). Learning logical definitions from relations. Machine Learning 5, 239–266.
Quinlan, J.R. (1991). Determinate literals in inductive logic programming. Proceedings Twelfth International Joint Conference on Artificial Intelligence, Sydney, 746–750.
Quinlan, J.R. (1992). C4.5: Programs for Machine Learning. San Mateo: Morgan Kaufmann.
Richards, B.L. and Mooney, R.J. (1991). First-order theory revision. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 447–451.
Rouveirol, C. (1991). Completeness for induction procedures. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 452–456.
Sammut, C.A., and Banerji, R.B. (1986). Learning concepts by asking questions. In R.S. Michalski, J.G. Carbonell and T.M. Mitchell (Eds.) Machine Learning: An Artificial Intelligence Approach (Vol 2). Los Altos: Morgan Kaufmann.
Shapiro, E.Y. (1983). Algorithmic Program Debugging. Cambridge, MA: MIT Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quinlan, J.R., Cameron-Jones, R.M. (1993). FOIL: A midterm report. In: Brazdil, P.B. (eds) Machine Learning: ECML-93. ECML 1993. Lecture Notes in Computer Science, vol 667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56602-3_124
Download citation
DOI: https://doi.org/10.1007/3-540-56602-3_124
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56602-1
Online ISBN: 978-3-540-47597-2
eBook Packages: Springer Book Archive