Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
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...
Main Author: | Hewitt, Carl |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6916 |
Similar Items
-
PLANNER: A Language for Manipulating Models and Proving Theorems in a Robot
by: Hewitt, Carl
Published: (2004) -
PLANNER: A Language for Proving Theorems
by: Hewitt, Carl
Published: (2004) -
Theorem proving [kasetvideo]
Published: (1969) -
Theorem proving [filem]
Published: (1969) -
A Reflective Functional Language for Hardware Design and Theorem Proving
by: Grundy, J, et al.
Published: (2006)