The utility of ebl in recursive domain theories

Authors:
Devika Subramanian;Ronen Feldman
Affiliations:
Computer Science Department, Cornell University, Ithaca, NY;Computer Science Department, Cornell University, Ithaca, NY
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Year:
1990

Citing 4
Cited 0

Acquiring Recursive and Iterative Concepts with Explanation-Based Learning

Machine Learning
Explanation-Based Generalization: A Unifying View

Machine Learning
Towards a general framework for composing disjunctive and iterative macro-operators

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
The effect of rule use on the utility of explanation-based learning

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the utility of explanation-based learning in recursive domain theories and examine the cost of using macro-rules in these theories. The compilation options in a recursive domain theory range from constructing partial unwindings of the recursive rules to converting recursive rules into iterative ones. We compare these options against using appropriately ordered rules in the original domain theory and demonstrate that unless we make very strong assumptions about the nature of the distribution of future problems, it is not profitable to form recursive macro-rules via explanation-based learning in these domains.