Selected papers that cite this one
- Anatoli Degtyarev, Yuri Matiyasevich, and Andrei Voronkov. Simultaneous E-unification and related algorithmic problems. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 494-502, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- Anatoli Degtyarev and Andrei Voronkov. The undecidability of simultaneous rigid E-unification. Theoretical Computer Science, 166(1-2):291-300, 20 October 1996. Note.
- Anatoli Degtyarev and Andrei Voronkov. Decidability problems for the prenex fragment of intuitionistic logic. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 503-512, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- 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 Goubault. Rigid E-unifiability is DEXPTIME-complete. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 498-506, Paris, France, 4-7 July 1994. IEEE Computer Society Press.
- Reiner Hähnle and Stefan Klingenbeck. A-ordered tableaux. Journal of Logic and Computation, 6(6):819-833, December 1996.
- 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.
- David A. Plaisted and Andrea Sattler-Klein. Proof lengths for equational completion. Information and Computation, 125(2):154-170, 15 March 1996.
- David J. Pym and James A. Harland. A uniform proof-theoretic investigation of linear logic programming. Journal of Logic and Computation, 4(2):175-207, April 1994.