Author:
Dershowitz Nachum,Kirchner Claude
Subject
General Computer Science,Theoretical Computer Science
Reference46 articles.
1. Term Rewriting and all That;Baader,1998
2. Equational inference, canonical proofs, and proof orderings;Bachmair;J. Assoc. Comput. Mach.,1994
3. L. Bachmair, N. Dershowitz, J. Hsiang, Orderings for equational proofs, in: Proc. First IEEE Symp. on Logic in Computer Science, Cambridge, MA, June 1986, pp. 346–357.
4. Completion without failure;Bachmair,1989
5. L. Bachmair, H. Ganzinger, Completion of first-order clauses with equality by strict superposition (Extended abstract), in: M. Okada, S. Kaplan (Eds.), Proc. Second Internat. Workshop on Conditional and Typed Term Rewriting Systems, Montreal, Canada, June 1990, Lecture Notes in Computer Science, Vol. 516, Springer, Berlin, 1991, pp. 162–180.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献