Efficient induction of recursive prolog definitions

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

Volumn 1081, Issue , 1996, Pages 240-248

  Rios, Riverson ^a   Matwin, Stan ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Inductive logic programming; Learning

Indexed keywords

EID: 77952007751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61291-2_55     Document Type: Conference Paper

References (19)

1. Aha, D., Lapointe, S., Ling, C. & Matwin, S. (1994a) Learning recursive relations with randomly selected small training sets. In Proc. llth ICML (12-18). New Brunswick, NJ
2. Aha, D., Lapointe, S., Ling, C. & Matwin, S. (1994b) Inverting implication with small training sets. In Proc. of the 1994 European Conf. on Machine Learning (31-48). Catania, Italy: Springer-Verlag
3. Chao, L. (1994). Using Argument Binding and Predicate Searching Schemes to Guide Partially Recursive Logic Programs Synthesis from Positive Examples. Master's Thesis. National Tsing-Hua University, China
4. Dolšak, N. & Muggleton, S. (1992). The application of ILP to finite-element mesh design. In Inductive Logic Programming, Edited by S. Muggleton, San Diego, CA: Academic Press
5. Dovey, M. (1995). Analysis of Rachmaninoff's piano performance using Inductive Logic Programming. In Proc. 8th European Conf on Machine Learning. Heraclion, Crete
6. Holte, R. (1995). Personal communication
7. Idestam-Almquist, P. (1995). Efficient induction of recursive definitions by structural analysis of saturation. In Proc. of the 5th Intl. Workshop on Inductive Logic Programming. Leuven, Belgium
8. Jorge, A. & Brazdil, P. (1995). Architecture for iterative learning of recursive deftnitions. In Proc. of the 5th Intl. Workshop on Inductive Logic Programming. Leuven, Belgium
9. Lapointe, S., Ling, C. & Matwin, S. (1993). Constructive inductive logic programruing. In Proc. 13th IJCAI (273-281). Chambtry, France: Morgan Kaufmann
10. Lapointe, S., & Matwin, S. (1992). Sub-unification: A tool for efficient induction of re, cursive programs. In Proc. 9th ICML (273-281). Aberdeen, Scotland: Morgan Kaufmann
11. Lavrač, N., Džeroski, S. & Grobelnik, M. (1991). Learning nonrecursive definitions of relations with LINUS. In Proc. Fifth European Working Session on Learning (265-281). Berlin, Germany: Springer Verlag
12. Ling, X. (1991). Inductive learning from good examples, In Proc. of the 12th IJCAI (751-756). Sydney, Australia
13. Muggleton, S. (1992). Inverting implication. In Proc. of the 9th European Workshop on Inductive Logic Programming. Vienna, Austria: unpublished
14. Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing Journal. May
15. Muggleton, S. & Feng, C. (1990). Efficient induction of logic programs. In Proc. of the First Intl. Workshop on Algorithmic Learning Theory (368-381). Tokyo, Japan: Ohmsha
16. Plotkin, G. (1971). Automatic Methods of Inductive Inference. PhD Thesis. Edinburgh University, Edinburgh, Scotland
17. Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning 5:239-266, Kluwer Academic
18. Stahl, I. (1995). The efficiency of bias shift operations in ILP. In Proc. of the 5th Intl. Workshop on Inductive Logic Programming. Leuven, Belgium
19. Sterling, L. & Shapiro, E. (1994). The Art of Prolog: Advanced Programming Techniques. MIT Press