Learning by Failing to Explain.

Abstract

Explanation-based Generalization requires that the learner obtain an explanation of why a precedent exemplifies a concept. It is, therefore, useless if the system fails to find this explanation. However, it is not necessary to give up and resort to purely empirical generalization methods. In fact, the system may already know almost everything it needs to explain the precedent. Learning by Failing to Explain is a method which is able to exploit current knowledge to prune complex precedents, isolating the mysterious parts of the precedent. The idea has two parts: the notion of partially analyzing a precedent to get rid of the parts which are already explainable, and the notion of re-analyzing old rules in terms of new ones, so that more general rules are obtained. Keywords: Graph grammar, Heuristic parsing, Subgraph isomorphism.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 29, 1986
Accession Number
ADA174730

Entities

People

  • Robert J. Hall

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Advanced Electronics
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Automata Theory
  • Circuits
  • Computer Languages
  • Computer Programming
  • Contrast
  • Gears
  • Grammars
  • Human Behavior
  • Language
  • Linguistics
  • Lisp Programming Language
  • Natural Language Processing
  • Natural Languages
  • Specifications
  • Standards

Fields of Study

  • Education

Readers

  • Artificial Intelligence
  • Graph Algorithms and Convex Optimization.
  • Military History of the United States in the 20th Century.