Abstract
We argue that explanation-based generalisation as recently proposed in the machine learning literature is essentially equivalent to partial evaluation, a well known technique in the functional and logic programming literature. We show this equivalence by analysing the definitions and underlying algorithms of both techniques, and by giving a Prolog program which can be interpreted as doing either explanation-based generalisation or partial evaluation.
Original language | English |
---|---|
Pages (from-to) | 401-412 |
Number of pages | 12 |
Journal | Artificial Intelligence |
Volume | 36 |
Issue number | 3 |
DOIs | |
Publication status | Published - Oct 1988 |