A knowledge-level analysis of explanation-based learning

  • Authors:
  • Masayuki Numao;Masamichi Shimura

  • Affiliations:
  • CSLI, Stanford University, Stanford, CA;Department of Computer Science, Tokyo Institute of Technology, 2-12-1 O-okayama, Meguro, Tokyo 152, Japan

  • Venue:
  • IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although Explanation-Based Learning (EBL) has up to now been used only for deductive learning that improves execution speed, chunking in Soar, which is closely related to EBL, was demonstrated to acquire new knowledge. We first analyze such knowledge level learning in EBL, by showing that a rule set is specialized when rules in it are replaced by their composition, and is generalized when a rule is replaced by its decomposition. Counting on this discussion, we propose a method to learn generalized rules by making a decomposition of instances. Since this method acquires knowledge that is deduced from domain theory and induced from instances, it is a natural method for combining empirical and explanation-based learning. We demonstrate deductive and inductive aspects of our method by examples of logic circuit design and geometric analogy.