The Utility of EBL in Recursive Domain Theories

Devika Subramanian, Ronen Feldman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

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.

Original languageAmerican English
Title of host publicationProceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990
PublisherAAAI Press
Pages942-949
Number of pages8
ISBN (Electronic)026251057X, 9780262510578
StatePublished - 1990
Externally publishedYes
Event8th National Conference on Artificial Intelligence, AAAI 1990 - Boston, United States
Duration: 29 Jul 19903 Aug 1990

Publication series

NameProceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990

Conference

Conference8th National Conference on Artificial Intelligence, AAAI 1990
Country/TerritoryUnited States
CityBoston
Period29/07/903/08/90

Bibliographical note

Publisher Copyright:
Copyright © 1990, AAAI (www.aaai.org). All rights reserved.

Fingerprint

Dive into the research topics of 'The Utility of EBL in Recursive Domain Theories'. Together they form a unique fingerprint.

Cite this