{"type":"ScholarlyArticle","title":"Avoiding Pitfalls When Learning Recursive Theories","authors":[{"name":"R. Mike Cameron-Jones","slug":"r-mike-cameron-jones","given":"R. Mike","family":"Cameron-Jones","affiliation":""},{"name":"J. Ross Quinlan","slug":"j-ross-quinlan","given":"J. Ross","family":"Quinlan","affiliation":""}],"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 .","doi":null,"url":"https://ijcai.org/proceedings/1993/145","pdf":"https://ijcai.org/proceedings/1993/0145.pdf","markdown":"https://ijcai.org/proceedings/1993/145.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/145","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Machine Learning","track":"Machine Learning","number":145,"pages":{"first":1050,"last":1056},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}