A Heuristic for Decomposing a Problem into a Sequence of Subproblems.

Abstract

This thesis presents a method for decomposing a specification of a problem into a sequence of subproblem specifications. The method uses the specification to build a tree-like structure called a semantic net. The net is then used to construct a sequence of subspecifications. Each subspecification of the sequence represents a subproblem. Composition of the solution to the subproblems results in a solution to the given problem specification. In this work, the author present an intuitive approach to what Artificial Intelligence and program synthesis is, define the sequence problem associated with program synthesis, and present the method for deriving a sequence of subspecifications. When this has been done, the method is then applied to a specific problem domain called the Blocks World. They then consider the method in a non-Blocks World domain and follow with a summary. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1982
Accession Number
ADA127417

Entities

People

  • Donald Vincent Evans

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Autonomy
  • Cyber
  • Energy and Power Technologies
  • Weapons Technologies

DTIC Thesaurus Topics

  • Artificial Intelligence
  • Automatic
  • Automatic Programming
  • California
  • Computer Programming
  • Computer Science
  • Computers
  • Construction
  • Language
  • New York
  • Operations Research
  • Schools
  • Sequences
  • Software Development
  • Specifications
  • Standards
  • United States

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computational Linguistics
  • Neural Network Machine Learning.
  • Operations Research

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation