Reasoning by Analogy as an Aid to Heuristic Theorem Proving

Abstract

When heuristic problem-solving programs are faced with large data bases that contain numbers of facts far in excess of those needed to solve any particular problem, their performance rapidly deteriorates. In this paper, the correspondence between a new unsolved problem and a previously solved analogous problem is computed and involved to tailer large data bases to manageable sizes. This paper outlines the design of an algorithm for generating and exploiting analogies between theorems posed to a resolution-logic system. These algorithms are believed to be the first computationally feasible development of reasoning by analogy to be applied to heuristic theorem proving.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1971
Accession Number
ADA638146

Entities

People

  • Robert E. Kling

Organizations

  • SRI International

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Classification
  • Contracts
  • Databases
  • Information Operations
  • Instructions
  • Monitoring
  • Reasoning
  • Security
  • Standards

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design