A heuristic for decomposing a problem into a sequence of subproblems.

Simple item page
dc.contributor.advisorSmith, Douglas R.
dc.contributor.authorEvans, Donald Vincent
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentComputer Science
dc.contributor.secondreaderMacLennan, Bruce J.
dc.dateDecember 1982
dc.date.accessioned2012-11-20T00:07:44Z
dc.date.available2012-11-20T00:07:44Z
dc.date.issued1982-12
dc.description.abstractThis 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 solutions of the subproblems results in a solution to the given problem specification. In this work, we 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. We then consider the method in a non-Blocks World domain and follow with a summary.en_US
dc.description.distributionstatementApproved for public release; distribution is unlimited.
dc.description.serviceCaptain, United States Marine Corpsen_US
dc.description.urihttp://archive.org/details/aheuristicfordec1094520196
dc.identifier.urihttps://hdl.handle.net/10945/20196
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.subject.authorprogram synthesisen_US
dc.subject.authorautomatic program synthesisen_US
dc.subject.authortop-down program synthesisen_US
dc.subject.authordecomposing problems into subproblemsen_US
dc.subject.authorartificial intelligenceen_US
dc.subject.lcshComputer scienceen_US
dc.titleA heuristic for decomposing a problem into a sequence of subproblems.en_US
dc.typeThesisen_US
dspace.entity.typePublication
etd.thesisdegree.disciplineComputer Scienceen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.nameM.S. in Computer Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
heuristicfordeco00evan.pdf
Size:
5.81 MB
Format:
Adobe Portable Document Format
Download
Collections
Theses