Polynomial-time Computation via Local Inference Relations

Details Polynomial-time Computation via Local Inference Relations Polynomial-time Computation via Local Inference Relations

2000-07-13

arxiv.org/abs/cs/0007020v2

Computer Science

Logic in Computer Science

22 pages. Appeared in Knowledge Representation and Reasoning,1993. Submitted to ACM Transactions on Computational Logic Correc

Scientific paper

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 bottom-up evaluation terminates in polynomial time. The local-rule-set transformation gives polynomial-time 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 polynomial-time predicate can be defined by an (unstratified) local rule set. Second, a new machine-recognizable subclass of the local rule sets is identified. Finally we show that locality, as a property of rule sets, is undecidable in general.

Affiliated with

Also associated with

No associations

Rating

Polynomial-time Computation via Local Inference Relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial-time Computation via Local Inference Relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-time Computation via Local Inference Relations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415552