Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6218Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Nevins, Arthur J. | - |
| dc.date | 2004-10-04T14:46:22Z | - |
| dc.date | 2004-10-04T14:46:22Z | - |
| dc.date | 1974-01-01 | - |
| dc.date.accessioned | 2013-10-09T02:44:15Z | - |
| dc.date.available | 2013-10-09T02:44:15Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-303 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6218 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | A computer program is described which operates on a subset of plane geometry. Its performance not only compares favorably with previous computer programs, but within its limited problem domain (e.g. no curved lines nor introduction of new points), it also invites comparison with the best human theorem provers. The program employs a combination of forward and backward chaining with the forward component playing the more important role. This, together with a deeper use of diagrammatic information, allows the program to dispense with the diagram filter in contrast with its central role in previous programs. An important aspect of human problem solving may be the ability to structure a problem space so that forward chaining techniques can be used effectively. | - |
| dc.format | 1553899 bytes | - |
| dc.format | 1183946 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-303 | - |
| dc.title | Plane Geometry Theorem Proving Using Forward Chaining | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.