Natural Language Based Inference Procedures Applied to Schubert's Steamroller
| dc.contributor.author | Givan, Robert | en_US |
| dc.contributor.author | McAllester, David | en_US |
| dc.contributor.author | Shalaby, Sameer | en_US |
| dc.date.accessioned | 2004-10-04T14:24:24Z | |
| dc.date.available | 2004-10-04T14:24:24Z | |
| dc.date.issued | 1991-12-01 | en_US |
| dc.identifier.other | AIM-1341 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5971 | |
| dc.description.abstract | We have previously argued that the syntactic structure of natural language can be exploited to construct powerful polynomial time inference procedures. This paper supports the earlier arguments by demonstrating that a natural language based polynomial time procedure can solve Schubert's steamroller in a single step. | en_US |
| dc.format.extent | 12 p. | en_US |
| dc.format.extent | 1093860 bytes | |
| dc.format.extent | 853931 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | AIM-1341 | en_US |
| dc.subject | natural language | en_US |
| dc.subject | Schubert's steamroller | en_US |
| dc.subject | automatedsinference | en_US |
| dc.subject | automated theorem proving | en_US |
| dc.subject | tractable inference | en_US |
| dc.subject | Socraticsproof systems | en_US |
| dc.title | Natural Language Based Inference Procedures Applied to Schubert's Steamroller | en_US |
