Journal of the ACM Bibliography

Selected papers that cite this one

• David Basin and Harald Ganzinger. Complexity analysis based on ordered resolution. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 456-465, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• Tore Langholm. A strong version of Herbrand's theorem for introvert sentences. The Journal of Symbolic Logic, 63(2):555-569, June 1998.

• David McAllester and Robert Givan. Taxonomic syntax for first order inference. Journal of the ACM, 40(2):246-283, April 1993.

Selected references

• Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, October 1980.

• Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164-177, Boulder, Colorado, 2-4 May 1977.

• David McAllester and Robert Givan. Taxonomic syntax for first order inference. Journal of the ACM, 40(2):246-283, April 1993.

• Greg Nelson and Derek C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, April 1980.

Shortcuts: