Natural Language Based Inference Procedures Applied to Schubert's Steamroller
Author(s)
Givan, Robert; McAllester, David; Shalaby, Sameer
DownloadAIM-1341.ps (1.043Mb)
Additional downloads
Metadata
Show full item recordAbstract
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.
Date issued
1991-12-01Other identifiers
AIM-1341
Series/Report no.
AIM-1341
Keywords
natural language, Schubert's steamroller, automatedsinference, automated theorem proving, tractable inference, Socraticsproof systems