Polynomial-time computation via local inference relations

@article{Givan2002PolynomialtimeCV,
  title={Polynomial-time computation via local inference relations},
  author={R. Givan and David A. McAllester},
  journal={ACM Trans. Comput. Log.},
  year={2002},
  volume={3},
  pages={521-541}
}
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 article discusses three new results. First, it is shown that every polynomial-time predicate can be… Expand
32 Citations
Congruence closure with ACI function symbols
  • Highly Influenced
  • PDF
Identifying Polynomial-Time Recursive Functions
  • 2
Polynomial Constraints for Sets with Cardinality Bounds
  • 4
  • PDF
Obtaining Finite Local Theory Axiomatizations via Saturation
  • 7
  • PDF
On Local Reasoning in Verification
  • 77
  • PDF
Classification of recursive functions into polynomial and superpolynomial complexity classes
  • PDF
Hierarchical Reasoning in Local Theory Extensions and Applications
  • Viorica Sofronie-Stokkermans
  • Mathematics, Computer Science
  • 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • 2014
  • 2
  • PDF
On Hierarchical Reasoning in Combinations of Theories
  • 28
  • PDF
...
1
2
3
4
...

References

SHOWING 1-3 OF 3 REFERENCES
Information and Control
  • 599
  • Highly Influential
  • PDF
40(2):284–303
  • April
  • 1993
Lifting tran formations
  • MIT Artificial Intelligence Laboratory Memo 1343,
  • 1991