Integrated Incremental Case-Based Understanding and Explanation: DMAP

Abstract

We have the following goals for our research with the direct memory access algorithm for understanding and inference: (a) using the DMA algorithm to carry out larger scale case-based reasoning; (b) improving the robustness of the understander; (c) exploring issues in parallelizing the algorithm. In what follows below, we will not make detailed reference to the algorithm, except to distinguish the two basic components of memory search - a. concept refinement, which goes from an abstract memory structure and some components of it to the most specific version of that memory structure that contains those components, and b. concept reference, which uses concept sequences to go from references to certain component concepts to the larger concept that contains those concepts. Concept refinement, for example, goes from a communication event by Milton Friedman to Milton Friedman's argument about interest rates. Concept reference goes from interest rates, and soar to the concept of rising interest rates. (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 31, 1988
Accession Number
ADA219919

Entities

People

  • Roger Schank

Organizations

  • Yale University

Tags

Communities of Interest

  • Autonomy
  • Materials and Manufacturing Processes
  • Space

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Cognitive Science
  • Computer Programming
  • Computer Science
  • Computers
  • Crisis Management
  • Language
  • Machine Learning
  • Natural Language Processing
  • Natural Languages
  • New York
  • Programming Languages
  • Reasoning
  • Standards
  • Universities

Readers

  • Computational Linguistics
  • Parallel and Distributed Computing.
  • Systems Analysis and Design

Technology Areas

  • AI & ML