Show simple item record

Toward a Theory of Representation Design

dc.date.accessioned2004-10-20T20:00:12Z
dc.date.accessioned2018-11-24T10:22:01Z
dc.date.available2004-10-20T20:00:12Z
dc.date.available2018-11-24T10:22:01Z
dc.date.issued1989-05-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6824
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6824
dc.description.abstractThis 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.extent219 p.en_US
dc.format.extent24550805 bytes
dc.format.extent9478311 bytes
dc.language.isoen_US
dc.subjectknowledge representationen_US
dc.subjectknowledge-based systemsen_US
dc.titleToward a Theory of Representation Designen_US


Files in this item

FilesSizeFormatView
AITR-1128.pdf9.478Mbapplication/pdfView/Open
AITR-1128.ps24.55Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record