Automatic Recognition of Tractability in Inference Relations

@article{McAllester1993AutomaticRO,
  title={Automatic Recognition of Tractability in Inference Relations},
  author={David A. McAllester},
  journal={J. ACM},
  year={1993},
  volume={40},
  pages={284-303}
}
A procedure is given for recognizing sets of inference rules that generate polynomial time decidable inference relations. The procedure can automatically recognize the tractability of the inference rules underlying congruence closure. The recognition of tractability for that particular rule set constitutes mechanical verification of a theorem originally proved independently by Kozen and Shostak. The procedure is algorithmic, rather than heuristic, and the class of automatically recognizable… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
74 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

An algorithm for reasoning about equality

  • R E.SHOSTACK.
  • Commun. ACM 21,
  • 1978
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…