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: | |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6144 |
_version_ | 1826203085164249088 |
---|---|
author | Hewitt, Carl |
author_facet | Hewitt, Carl |
author_sort | Hewitt, Carl |
collection | MIT |
description | 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. |
first_indexed | 2024-09-23T12:31:05Z |
id | mit-1721.1/6144 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T12:31:05Z |
publishDate | 2004 |
record_format | dspace |
spelling | mit-1721.1/61442019-04-12T08:29:26Z PLANNER: A Language for Proving Theorems Hewitt, Carl 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. 2004-10-04T14:43:07Z 2004-10-04T14:43:07Z 1967-07-01 AIM-137 http://hdl.handle.net/1721.1/6144 en_US AIM-137 51224292 bytes 1565807 bytes application/postscript application/pdf application/postscript application/pdf |
spellingShingle | Hewitt, Carl PLANNER: A Language for Proving Theorems |
title | PLANNER: A Language for Proving Theorems |
title_full | PLANNER: A Language for Proving Theorems |
title_fullStr | PLANNER: A Language for Proving Theorems |
title_full_unstemmed | PLANNER: A Language for Proving Theorems |
title_short | PLANNER: A Language for Proving Theorems |
title_sort | planner a language for proving theorems |
url | http://hdl.handle.net/1721.1/6144 |
work_keys_str_mv | AT hewittcarl planneralanguageforprovingtheorems |