Natural Language Based Inference Procedures Applied to Schubert's Steamroller.

摘要

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.... Natural language, Automated theorem proving, Tractable inference, Schubert's steamroller, Automated inference, Socratic proof systems.