PLANNER: A Language for Proving Theorems
The following is a description of SCHEMATISE, a proposal for a program that proves very elementary theorems though the use of planning. The method is most easily explained through an example die to Black.
Main Author: | Hewitt, Carl |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6144 |
Similar Items
-
PLANNER: A Language for Manipulating Models and Proving Theorems in a Robot
by: Hewitt, Carl
Published: (2004) -
Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
by: Hewitt, Carl
Published: (2004) -
Elementary Geometry Theorem Proving
by: Goldstein, Ira
Published: (2004) -
A Proposal for a Geometry Theorem Proving Program
by: Hart, Timothy P.
Published: (2004) -
Theorem-proving distributed algorithms with dynamic analysis
by: Ne Win, Toh, 1979-
Published: (2006)