Natural language based inference procedures applied to schubert's steamroller

Authors:
Robert Givan;David McAllester;Sameer Shalaby
Affiliations:
MIT Artificial Intelligence Laboratory, Cambridge, MA;MIT Artificial Intelligence Laboratory, Cambridge, MA;MIT Artificial Intelligence Laboratory, Cambridge, MA
Venue:
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Year:
1991

Citing 9
Cited 0

Automated deduction by theory resolution

Journal of Automated Reasoning
Controlling deduction with proof condensation and heuristics

Proc. of the 8th international conference on Automated deduction
Bottom-up enhancements of deductive systems

on Artificial Intelligence and Information-Control systems of Robots-87
Schubert's steamroller in a natural deduction theorem prover

Proceedings of Expert Systems '87 on Research and Development in Expert Systems IV
Ontic: a knowledge representation system for mathematics

Ontic: a knowledge representation system for mathematics
Towards a theory of access-limited logic for knowledge representation

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Taxonomic syntax for first order inference

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Natural Language Syntax and First Order Inference

Natural Language Syntax and First Order Inference
Automatic Recognition of Tractability for Inference Relations

Automatic Recognition of Tractability for Inference Relations

Quantified Score

Hi-index	0.00

Visualization

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.