A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
ProGolem: A System Based on Relative Minimal Generalisation
[chapter]
2010
Lecture Notes in Computer Science
Over the last decade Inductive Logic Programming systems have been dominated by use of top-down refinement search techniques. In this paper we re-examine the use of bottom-up approaches to the construction of logic programs. In particular, we explore variants of Plotkin's Relative Least General Generalisation (RLGG) which are based on subsumption relative to a bottom clause. With Plotkin's RLGG, clause length grows exponentially in the number of examples. By contrast, in the Golem system, the
doi:10.1007/978-3-642-13840-9_13
fatcat:4bv7lufphzfghepie46xgqqtmy