Induction of logic programs with more than one recursive clause by analyzing saturations
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.
Unable to display preview. Download preview PDF.
- 1.Quinlan, J. R.: “Learning logical definitions from relations”, Machine Learning, 5, pp.239–266 (1990).Google Scholar
- 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.Muggleton, S.: “Inverse entailment and progol”, New Generation Computing, 3+4, pp.245–286 (1995).Google Scholar
- 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.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.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.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.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