Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Learning from good and bad data
Learning from good and bad data
A general explanation-based learning mechanism and its application to narrative understanding
A general explanation-based learning mechanism and its application to narrative understanding
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Towards a formal analysis of EBL
Proceedings of the sixth international workshop on Machine learning
Explanation-Based Generalization: A Unifying View
Machine Learning
Mechanical transformation of task heuristics into operational procedures
Mechanical transformation of task heuristics into operational procedures
Learning effective search control knowledge: an explanation-based approach
Learning effective search control knowledge: an explanation-based approach
Failsafe: a floor planner that uses EBG to learn from its failures
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
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.