College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Not the Last Word on EBL Algorithms|
|Authors: ||Elkan, Charles P.|
Segre, Alberto M.
|Keywords: ||computer science|
|Issue Date: ||May-1989|
|Publisher: ||Cornell University|
|Abstract: ||This paper describes a new domain-independent explanation-based learning (EBL) algorithm that is able to acquire useful new rules in situations where previous EBL algorithms would fail. The new algorithm is complete in the sense that every valid rule that can be extracted from an explanation can be extracted by this algorithm. The new algorithm is described inside a framework that provides insight into how the design of successful EBL systems takes into account operationality and imperfect domain theory issues.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.