Publisher
Springer International Publishing
Reference16 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1-2), 133–178 (2000)
2. Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. Journal of Automated Reasoning 49(1), 53–93 (2012)
3. Lecture Notes in Computer Science;N. Dershowitz,2004
4. Fuhs, C., Giesl, J., Parting, M., Schneider-Kamp, P., Swiderski, S.: Proving termination by dependency pairs and inductive theorem proving. Journal of Automated Reasoning 47(2), 133–160 (2011)
5. Fuhs, C., Kop, C.: First-order formative rules. Technical Report arXiv:1404.7695 [cs.LO] (2014),
http://arxiv.org/abs/1404.7695
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献