EBG and Term-Rewriting Systems
Abstract
We show that the familiar explanation-based general-ization (EBG) procedure is applicable to a large fam-ily of programming languages, including three families of importance to AI: logic programming (such as Pro-log); lambda calculus (such as LISP); and combinator languages (such as FP). The main application of this re-sult is to extend the algorithm to domains for which pred-icate calculus is a poor representation. In addition, many issues in analytical learning become clearer and easier to reason about.
Cite
Text
Laird and Gamble. "EBG and Term-Rewriting Systems." International Conference on Algorithmic Learning Theory, 1990.Markdown
[Laird and Gamble. "EBG and Term-Rewriting Systems." International Conference on Algorithmic Learning Theory, 1990.](https://mlanthology.org/alt/1990/laird1990alt-ebg/)BibTeX
@inproceedings{laird1990alt-ebg,
title = {{EBG and Term-Rewriting Systems}},
author = {Laird, Philip D. and Gamble, Evan},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {1990},
pages = {425-440},
url = {https://mlanthology.org/alt/1990/laird1990alt-ebg/}
}