Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6824Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Baalen, Jeffrey Van | - |
| dc.date | 2004-10-20T20:00:12Z | - |
| dc.date | 2004-10-20T20:00:12Z | - |
| dc.date | 1989-05-01 | - |
| dc.date.accessioned | 2013-10-09T02:47:06Z | - |
| dc.date.available | 2013-10-09T02:47:06Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AITR-1128 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6824 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This research is concerned with designing representations for analytical reasoning problems (of the sort found on the GRE and LSAT). These problems test the ability to draw logical conclusions. A computer program was developed that takes as input a straightforward predicate calculus translation of a problem, requests additional information if necessary, decides what to represent and how, designs representations capturing the constraints of the problem, and creates and executes a LISP program that uses those representations to produce a solution. Even though these problems are typically difficult for theorem provers to solve, the LISP program that uses the designed representations is very efficient. | - |
| dc.format | 219 p. | - |
| dc.format | 24550805 bytes | - |
| dc.format | 9478311 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AITR-1128 | - |
| dc.subject | knowledge representation | - |
| dc.subject | knowledge-based systems | - |
| dc.title | Toward a Theory of Representation Design | - |
| 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.
