PLANNER: A Language for Proving Theorems
| dc.date.accessioned | 2004-10-04T14:43:07Z | |
| dc.date.accessioned | 2018-11-24T10:12:05Z | |
| dc.date.available | 2004-10-04T14:43:07Z | |
| dc.date.available | 2018-11-24T10:12:05Z | |
| dc.date.issued | 1967-07-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6144 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6144 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 51224292 bytes | |
| dc.format.extent | 1565807 bytes | |
| dc.language.iso | en_US | |
| dc.title | PLANNER: A Language for Proving Theorems | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-137.pdf | 1.565Mb | application/pdf | View/ |
| AIM-137.ps | 51.22Mb | application/postscript | View/ |