Determinate literals in inductive logic programming

Authors:
J. R. Quinlan
Affiliations:
Basser Department of Computer Science, University of Sydney, Sydney, NSW, Australia
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Year:
1991

Citing 3
Cited 2

Generalized subsumption and its applications to induction and redundancy

Artificial Intelligence
Algorithmic Program DeBugging

Algorithmic Program DeBugging
Learning Logical Definitions from Relations

Machine Learning

Macro-Operators in Multirelational Learning: A Search-Space Reduction Technique

ECML '02 Proceedings of the 13th European Conference on Machine Learning
A Model to Study Phase Transition and Plateaus in Relational Learning

ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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 list-manipulation functions.