A deductive model of control of a problem solver

  • Authors:
  • Drew McDermott

  • Affiliations:
  • Yale University, New Haven

  • Venue:
  • ACM SIGART Bulletin
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

The efficiency of problem-solving computer programs, has suffered from such programs willingness to search problem spaces blindly and their inability to accept new information that would help. A new approach is described, in which the problem solver is driven by a theorem prover which retrieves and chooses among solution plans. The theorem prover can accept new deductive rules expressed in the problem solver's control vocabulary. In this way, the advantages of determinism and extensibility are achieved. A program called NASL embodying this approach has been implemented and applied to the domain of simple electronic circuit design.