Tractable Inference Relations

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

Full metadata record

DC Field	Value	Language
dc.creator	Givan, Robert	-
dc.creator	McAllester, David	-
dc.date	2004-10-04T14:24:22Z	-
dc.date	2004-10-04T14:24:22Z	-
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-1344	-
dc.identifier	http://hdl.handle.net/1721.1/5969	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	We consider the concept of local sets of inference rules. Locality is a syntactic condition on rule sets which guarantees that the inference relation defined by those rules is polynomial time decidable. Unfortunately, determining whether a given rule set is local can be difficult. In this paper we define inductive locality, a strengthening of locality. We also give a procedure which can automatically recognize the locality of any inductively local rule set. Inductive locality seems to be more useful that the earlier concept of strong locality. We show that locality, as a property of rule sets, is undecidable in general.	-
dc.format	14 p.	-
dc.format	1309278 bytes	-
dc.format	1033613 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1344	-
dc.subject	tractable inference	-
dc.subject	automated reasoning	-
dc.subject	theorem proving	-
dc.subject	sSocratic proof systems	-
dc.subject	polynomial time	-
dc.subject	relational data basers	-
dc.title	Tractable Inference Relations	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI