Polynomialtime Computation via Local Inference Relations
Abstract
We consider the concept of a local set of inference rules. A local rule set can be automatically transformed into a rule set for which bottomup evaluation terminates in polynomial time. The localruleset transformation gives polynomialtime evaluation strategies for a large variety of rule sets that cannot be given terminating evaluation strategies by any other known automatic technique. This paper discusses three new results. First, it is shown that every polynomialtime predicate can be defined by an (unstratified) local rule set. Second, a new machinerecognizable subclass of the local rule sets is identified. Finally we show that locality, as a property of rule sets, is undecidable in general.
 Publication:

arXiv eprints
 Pub Date:
 July 2000
 arXiv:
 arXiv:cs/0007020
 Bibcode:
 2000cs........7020G
 Keywords:

 Computer Science  Logic in Computer Science;
 Computer Science  Artificial Intelligence;
 Computer Science  Programming Languages;
 I.2.2;
 I.2.3;
 I.2.4;
 F.4.m
 EPrint:
 22 pages. Appeared in Knowledge Representation and Reasoning,1993. Submitted to ACM Transactions on Computational Logic Correction: original conference appearance was 1992, not 1993