Tractable Inference Relations
Author(s)Givan, Robert; McAllester, David
MetadataShow full item record
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.
tractable inference, automated reasoning, theorem proving, sSocratic proof systems, polynomial time, relational data basers