Selected papers that cite this one
- W. Bibel and E. Eder. Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. Journal of the ACM, 44(2):320-344, March 1997.
- Jean Gallier, Paliath Narendran, David Plaisted, Stan Raatz, and Wayne Snyder. An algorithm for finding canonical sets of ground rewrite rules in polynomial time. Journal of the ACM, 40(1):1-16, January 1993.
- Jean Gallier, Paliath Narendran, Stan Raatz, and Wayne Snyder. Theorem proving using equational matings and rigid E-unification. Journal of the ACM, 39(2):377-429, April 1992.
- C. A. Johnson. Factorization and circuit in the connection method. Journal of the ACM, 40(3):536-557, July 1993.
- Neil V. Murray and Erik Rosenthal. Dissolution: Making paths vanish. Journal of the ACM, 40(3):504-535, July 1993.
- H. J. Ohlbach. Semantics-based translation methods for modal logics. Journal of Logic and Computation, 1(5):691-746, October 1990.