Advertisement

FOIL: A midterm report

  • J. R. Quinlan
  • R. M. Cameron-Jones
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 667)

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.

References

  1. 1.
    Bratko, I. (1986). Prolog Programming for Artificial Intelligence. Wokingham, UK: Addison-Wesley.Google Scholar
  2. 2.
    Breiman, L., Friedman, J.H., Olshen, R.A. and Stone, C.J. (1984). Classification and Regression Trees. Belmont: Wadsworth International.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Clark, P and Niblett, T. (1987). Induction in noisy domains. In Bratko and Lavrač (Eds.) Progress in Machine Learning. Wilmslow: Sigma Press.Google Scholar
  6. 6.
    Kietz, J. and Morik, K. (1993). A polynomial approach to the constructive induction of structural knowledge. Machine Learning, to appear.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    Muggleton, S., and Feng, C. (1990). Efficient induction of logic programs. Proceedings First Conference on Algorithmic Learning Theory, Tokyo.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    Pazzani, M.J. and Kibler, D. (1992). The utility of knowledge in inductive learning. Machine Learning 9, 1, 57–94.Google Scholar
  13. 13.
    Quinlan, J.R. (1990). Learning logical definitions from relations. Machine Learning 5, 239–266.Google Scholar
  14. 14.
    Quinlan, J.R. (1991). Determinate literals in inductive logic programming. Proceedings Twelfth International Joint Conference on Artificial Intelligence, Sydney, 746–750.Google Scholar
  15. 15.
    Quinlan, J.R. (1992). C4.5: Programs for Machine Learning. San Mateo: Morgan Kaufmann.Google Scholar
  16. 16.
    Richards, B.L. and Mooney, R.J. (1991). First-order theory revision. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 447–451.Google Scholar
  17. 17.
    Rouveirol, C. (1991). Completeness for induction procedures. Proceedings Eighth International Workshop on Machine Learning, Evanston, Illinois, 452–456.Google Scholar
  18. 18.
    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.Google Scholar
  19. 19.
    Shapiro, E.Y. (1983). Algorithmic Program Debugging. Cambridge, MA: MIT Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • J. R. Quinlan
    • 1
  • R. M. Cameron-Jones
    • 1
  1. 1.Basser Department of Computer ScienceUniversity of SydneySydneyAustralia

Personalised recommendations