Extending EBG to Term-Rewriting Systems
Abstract
We show that the familiar explanation-based generalization (EBG) procedure is applicable to a large family of programming languages, including three families of importance to AI: logic programming (such as Prolog); lambda calculus (such as LISP); and combinator languages (such as FP). The main application of this result is to extend the algorithm to domains for which predicate calculus is a poor representation. In addition, many issues in analytical learning become clearer and easier to reason about.
Cite
Text
Laird and Gamble. "Extending EBG to Term-Rewriting Systems." AAAI Conference on Artificial Intelligence, 1990.Markdown
[Laird and Gamble. "Extending EBG to Term-Rewriting Systems." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/laird1990aaai-extending/)BibTeX
@inproceedings{laird1990aaai-extending,
title = {{Extending EBG to Term-Rewriting Systems}},
author = {Laird, Philip D. and Gamble, Evan},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1990},
pages = {929-935},
url = {https://mlanthology.org/aaai/1990/laird1990aaai-extending/}
}