Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. L. Bachmair and H. Ganzinger. Ordered chaining calculi for first-order theories of binary relations. Technical Report MPI-I-95-2-009, Max-Plank-Institut für Informatik, 1995.
2. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. In TAPSOF’97, volume 1214 of Lecture Notes in Com-puter Science, pages 67–92. Springer, 1997.
3. H. Comon. Completion of rewrite systems with membership constraints, Part I: Deduction rules. Journal of Symbolic Computation, 25(4):397–419, 1998.
4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier Science, 1990.
5. S. Eker and J. Meseguer. Design of the equational proving tools for Cafe, Mar. 1997. Slides of a talk given at the Cafe Workshop, Japan.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献