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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1297, Issue , 1997, Pages 165-172

  Furusawa, Mitsue ^a   Inuzuka, Nobuhiro ^b   Seki, Hirohisa ^b   Itoh, Hidenori ^b  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

^b NAGOYA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38049102493     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540635149_45     Document Type: Conference Paper

References (8)

1. Quinlan, J. R.: "Learning logical definitions from relations", Machine Learning, 5, pp.239-266 (1990).
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).
3. Muggleton, S.: "Inverse entailment and progol", New Generation Computing, 3+4, pp.245-286 (1995).
4. Muggleton, S., Peng, C.: "Efficient induction of logic programs", Proc. Workshop on Algorithmic Learning Theory, Ohmsma, Tokyo, pp.368-381 (1990).
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).
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)
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).
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 Ohmsha, pp.192-205 (1996).