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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5971 |
| Date | 01 December 1991 |
| Creators | Givan, Robert, McAllester, David, Shalaby, Sameer |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 12 p., 1093860 bytes, 853931 bytes, application/postscript, application/pdf |
| Relation | AIM-1341 |
Page generated in 0.1258 seconds