Natural Language Based Inference Procedures Applied to Schubert's Steamroller

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5971

Full metadata record

DC Field	Value	Language
dc.creator	Givan, Robert	-
dc.creator	McAllester, David	-
dc.creator	Shalaby, Sameer	-
dc.date	2004-10-04T14:24:24Z	-
dc.date	2004-10-04T14:24:24Z	-
dc.date	1991-12-01	-
dc.date.accessioned	2013-10-09T02:42:09Z	-
dc.date.available	2013-10-09T02:42:09Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1341	-
dc.identifier	http://hdl.handle.net/1721.1/5971	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	12 p.	-
dc.format	1093860 bytes	-
dc.format	853931 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1341	-
dc.subject	natural language	-
dc.subject	Schubert's steamroller	-
dc.subject	automatedsinference	-
dc.subject	automated theorem proving	-
dc.subject	tractable inference	-
dc.subject	Socraticsproof systems	-
dc.title	Natural Language Based Inference Procedures Applied to Schubert's Steamroller	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI