Model-Driven Geometry Theorem Prover

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5785

Full metadata record

DC Field	Value	Language
dc.creator	Ullman, Shimon	-
dc.date	2004-10-01T20:36:53Z	-
dc.date	2004-10-01T20:36:53Z	-
dc.date	1975-05-01	-
dc.date.accessioned	2013-10-09T02:41:17Z	-
dc.date.available	2013-10-09T02:41:17Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-321	-
dc.identifier	http://hdl.handle.net/1721.1/5785	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	This paper describes a new Geometry Theorem Prover, which was implemented to illuminate some issues related to the use of models in theorem provin. The paper is divided into three parts: Part 1 describes G.T.P. and presents the ideas embedded in it. It concentrates on the forward search method, and gives two examples of proofs produced that way. Part 2 describes the backward search mechanism and presents proofs to a sequence of successively harder problems. The last section of the work addresses the notion of similarity in a problem, defines a notion of semantic symmetry, and compares it to Gelernter's concept of syntactic symmetry.	-
dc.format	56 p.	-
dc.format	3074279 bytes	-
dc.format	2316645 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-321	-
dc.title	Model-Driven Geometry Theorem Prover	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI