Avoiding Pitfalls When Learning Recursive Theories (1993)
| Venue: | In Proceedings of the 13th International Joint Conference on Artificial Intelligence |
| Citations: | 25 - 2 self |
BibTeX
@INPROCEEDINGS{Quinlan93avoidingpitfalls,
author = {Cameron-Jones Quinlan and R. M. Cameron-jones and J. R. Quinlan},
title = {Avoiding Pitfalls When Learning Recursive Theories},
booktitle = {In Proceedings of the 13th International Joint Conference on Artificial Intelligence},
year = {1993},
pages = {1050--1055},
publisher = {Morgan Kaufmann}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Learning systems that express theories in firstorder logic must ensure that the theories are executable and, in particular, that they do not lead to infinite recursion. This paper presents a heuristic method for preventing infinite recursion in the (multi-clause) definition of a recursive relation. The method has been implemented in the latest version of foil, but could also be used with any learning method that grows clauses from ground facts by repeated specialization. Results on several examples, including Ackermann's function, are presented. 1 Introduction A growing cohort of systems now learn first-order theories to explain observations. Early examples, mis [Shapiro, 1983] and marvin [Sammut and Banerji, 1986], have been joined by cigol [Muggleton and Buntine, 1988], foil [Quinlan, 1990, 1991], golem [Muggleton and Feng, 1990], focl [Pazzani, Brunk and Silverstein, 1991; Pazzani and Kibler, 1992], ile [Rouveirol, 1991] and others. The reason for looking beyond familiar proposit...
Citations
| 962 | Efficient induction of logic programs - Muggleton, Feng - 1990 |
| 784 | Learning logical definitions from relations - Quinlan - 1989 |
| 439 | Algorithmic Program Debugging - Shapiro - 1983 |
| 162 | Machine invention of first-order predicates by inverting resolution - Muggleton, Buntine - 1988 |
| 140 | The utility of knowledge in inductive learning - Pazzani, Kibler - 1992 |
| 91 | Learning concepts by asking questions - Sammut, Banerji - 1986 |
| 56 | Determinate literals in inductive logic programming - Quinlan - 1991 |
| 44 | A knowledgeintensive approach to learning relational concepts - Pazzani, Brunk, et al. - 1991 |
| 7 | Completeness for inductive procedures - Rouveirol - 1991 |
