Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Term rewriting and all that;Baader,1998
2. Canonical Equational Proofs;Bachmair,1991
3. L. Bachmair and H. Ganzinger. Rewrite techniques for transitive relations. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 384–393. IEEE Computer Society Press, 1994.
4. Termination orderings for associative-commutative rewriting systems;Bachmair;J. Symbolic Computation,1985
5. L. Bachmair, C.R. Ramakrishnan, I.V. Ramakrishnan, and A. Tiwari. Normalization via rewrite closures. In P. Narendran and M. Rusinowitch, editors, Rewriting Techniques and Applications, 10th International Conference, RTA-99, volume 1631 of LNCS, pages 190–204. Springer-Verlag, 1999.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献