Structured planning and debugging

Authors:
Mark L. Miller;Ira P. Goldstein
Affiliations:
Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts;Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts
Venue:
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
Year:
1977

Citing 6
Cited 0

The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Transition network grammars for natural language analysis

Communications of the ACM
A Computer Model of Skill Acquisition

A Computer Model of Skill Acquisition
Using knowledge to understand

TINLAP '75 Proceedings of the 1975 workshop on Theoretical issues in natural language processing
Human Problem Solving

Human Problem Solving
Structured programming

Structured programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The SPADE theory uses linguistic formalisms to model the program planning and debugging processes. The theory begins with a taxonomy of basic planning concepts covering strategies for identification, decomposition and reformulation. A handle is provided for recognizing interactions between goals and deriving a lincnr solution. A complementary taxonomy of rational bugs and associated repair techniques is also provided. SPA OK. introduces a new data structure to facilitate debugging -- the derivation tree of the program. SPADE generalizes recent work in Artificial Intelligence by Suasman and Sacerdoti on automatic programming, and extends The theory of program design developed by the Structured Programming movement. It provides a more structured information processing model of human problem solving than the production systems of Newell and Simon, and articulates the type of problem solving curriculum advocated by Papert's Logo Project.