Advertisement

Induction of logic programs with more than one recursive clause by analyzing saturations

  • Mitsue Furusawa
  • Nobuhiro Inuzuka
  • Hirohisa Seki
  • Hidenori Itoh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1297)

Abstract

This paper describes a bottom-up ILP algorithm called MRI, which induces recursive programs with one or more recursive clauses from a few of examples. It analyzes saturations using path structures, which express streams of terms processed by predicates and was originally introduced by Identam-Almquist. We introduce extension and difference of path structures. Recursive clauses can be expressed as a difference among path structures. The paper also shows experimental results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Quinlan, J. R.: “Learning logical definitions from relations”, Machine Learning, 5, pp.239–266 (1990).Google Scholar
  2. 2.
    Quinlan, J. R., Cameron-Jones, R. M.: “FOIL: A midterm report”, In P. Brazdil, editor, Proc. 6th European Conf. on Machine Learning, LNAI 667, Springer-Verlag, pp.3–20 (1993).Google Scholar
  3. 3.
    Muggleton, S.: “Inverse entailment and progol”, New Generation Computing, 3+4, pp.245–286 (1995).Google Scholar
  4. 4.
    Muggleton, S., Feng, C.: “Efficient induction of logic programs”, Proc. Workshop on Algorithmic Learning Theory, Ohmsma, Tokyo, pp.368–381 (1990).Google Scholar
  5. 5.
    Lapointe, S., Matwin, S.: “A tool for efficient induction of recursive programs”, Proc. 11th Int'l Conf. on Machine Learning, Morgan Kaufmann, pp.273–281 (1992).Google Scholar
  6. 6.
    Aha, D. W., Lapointe, S., Ling, C. X., Matwin, S.: “Inverting Implication with Small Training Sets”, Proc. 7th European Conf. on Machine Learning, LNAI 784, Springer-Verlag, pp.31–48 (1994)Google Scholar
  7. 7.
    Aha, D. W., Lapointe, S., Ling, C. X., Matwin, S.: “Learning Recursive Relations with Randomly Selected Small Training Sets”, Proc. 11th Int'l Conf. on Machine Learning, Morgan Kaufmann, pp.12–18 (1994).Google Scholar
  8. 8.
    Idestam-Almquist, P.: “Efficient Induction of Recursive Definitions by Structural Analysis of Saturations”, in Advances in Inductive Logic Programming, L.De Raedt (ed.), IOS Press Ohmsma, pp.192–205 (1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Mitsue Furusawa
    • 1
  • Nobuhiro Inuzuka
    • 2
  • Hirohisa Seki
    • 2
  • Hidenori Itoh
    • 2
  1. 1.Mitsubishi Electric EngineeringKita-ku, NagoyaJapan
  2. 2.Nagoya Institute of TechnologyShowa-ku, NagoyaJapan

Personalised recommendations