Author:
Winkler Sarah,Moser Georg
Publisher
Springer International Publishing
Reference18 articles.
1. Avenhaus, J., Hillenbrand, T., Löchner, B.: On using ground joinable equations in equational theorem proving. JSC 36(1–2), 217–233 (2003).
https://doi.org/10.1016/S0747-7171(03)00024-5
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998).
https://doi.org/10.1017/CBO9781139172752
3. Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Aït Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, Rewriting Techniques of Progress in Theoretical Computer Science, vol. 2, pp. 1–30. Academic Press, Cambridge (1989)
4. Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the confluence of ordered term rewrite systems. ACM TOCL 4(1), 33–55 (2003).
https://doi.org/10.1145/601775.601777
5. Lecture Notes in Computer Science;B Dutertre,2006
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献