Toward a Theory of Representation Design
dc.date.accessioned | 2004-10-20T20:00:12Z | |
dc.date.accessioned | 2018-11-24T10:22:01Z | |
dc.date.available | 2004-10-20T20:00:12Z | |
dc.date.available | 2018-11-24T10:22:01Z | |
dc.date.issued | 1989-05-01 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/6824 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6824 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 219 p. | en_US |
dc.format.extent | 24550805 bytes | |
dc.format.extent | 9478311 bytes | |
dc.language.iso | en_US | |
dc.subject | knowledge representation | en_US |
dc.subject | knowledge-based systems | en_US |
dc.title | Toward a Theory of Representation Design | en_US |
Files in this item
Files | Size | Format | View |
---|---|---|---|
AITR-1128.pdf | 9.478Mb | application/pdf | View/ |
AITR-1128.ps | 24.55Mb | application/postscript | View/ |