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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/6824 |
| Date | 01 May 1989 |
| Creators | Baalen, Jeffrey Van |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 219 p., 24550805 bytes, 9478311 bytes, application/postscript, application/pdf |
| Relation | AITR-1128 |
Page generated in 0.0188 seconds