Author:
Yamada Akihisa,Winkler Sarah,Hirokawa Nao,Middeldorp Aart
Publisher
Springer International Publishing
Reference22 articles.
1. Lecture Notes in Computer Science;B. Alarcón,2010
2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(1-2), 133–178 (2000)
3. Bachmair, L., Plaisted, D.A.: Termination orderings for associative-commutative rewriting systems. JSC 1, 329–349 (1985)
4. Ben Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. SCP 9(2), 137–159 (1987)
5. Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. JAR 49(1), 53–93 (2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. AC-KBO revisited;Theory and Practice of Logic Programming;2015-06-08
2. AC-KBO Revisited;Functional and Logic Programming;2014