Accession Number:

AD0744620

Title:

Description and Theoretical Analysis (Using Schemata) of PLANNER: a Language for Proving Theorems and Manipulating Models in a Robot

Descriptive Note:

Doctoral thesis

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB

Personal Author(s):

• Hewitt, Carl

Report Date:

1972-04-01

Pagination or Media Count:

445.0

Abstract:

PLANNER is a formalism for proving theorems and manipulating models in a robot. The formalism is built out of a number of problem-solving primitives together with a hierarchical multiprocess backtrack control structure. Statements can be asserted and perhaps later withdrawn as the state of the world changes. Under BACKTRACK control structure, the hierarchy of activations of functions previously executed is maintained so that it is possible to revert to any previous state. Thus programs can easily manipulate elaborate hypothetical tentative states. In addition PLANNER uses multiprocessing so that there can be multiple loci of control over the problem-solving.

Descriptors:

• *PROGRAMMING LANGUAGES
• *ARTIFICIAL INTELLIGENCE
• SEMANTICS
• MATHEMATICAL LOGIC
• COMPILERS
• MULTIPLE OPERATION
• THEOREMS
• CONTROL SEQUENCES
• SYNTAX
• THESES
• PROBLEM SOLVING
• PATTERN RECOGNITION

Subject Categories:

• Computer Programming and Software
• Bionics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE