{"type":"ScholarlyArticle","title":"Determinate Literals in Inductive Logic Programming","authors":[{"name":"J. Ross Quinlan","slug":"j-ross-quinlan","given":"J. Ross","family":"Quinlan","affiliation":""}],"abstract":"A recent system, FOIL, constructs Horn clause programs from numerous examples. Computational efficiency is achieved by using greedy search guided by an information-based heuristic. Greedy search tends to be myopic but determinate terms, an adaptation of an idea introduced by another new system (GOLEM), has been found to provide many of the benefits of lookahead without substantial increases in computation. This paper sketches key ideas from FOIL and GOLEM and discusses the use of determinate literals in a greedy search context. The efficacy of this approach is illustrated on the task of learning the quicksort procedure and other small but non-trivial listmanipulation functions.","doi":null,"url":"https://ijcai.org/proceedings/1991/109","pdf":"https://ijcai.org/proceedings/1991/0109.pdf","markdown":"https://ijcai.org/proceedings/1991/109.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/109","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Learning Be Knowledge Acquisition","track":"Learning Be Knowledge Acquisition","number":109,"pages":{"first":746,"last":749},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}