Author:
Giesl Jürgen,Kapur Deepak
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Lect Notes Comput Sci;T. Arts,1997
2. Lect Notes Comput Sci;T. Arts,1998
3. T. Arts and J. Giesl, Termination of Term Rewriting Using Dependency Pairs, Theoretical Computer Science, 236:133–178, 2000.
4. Lect Notes Comput Sci;T. Arts,2000
5. F. Baader and W. Snyder, Unification Theory, in Handbook of Automated Reasoning, J. A. Robinson and A. Voronkov (eds.), Elsevier. To appear.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Dependency Pair Framework for Relative Termination of Term Rewriting;Lecture Notes in Computer Science;2024
2. Well-Founded Unions;Automated Reasoning;2018
3. Relative Termination via Dependency Pairs;Journal of Automated Reasoning;2016-04-30
4. Reducing Relative Termination to Dependency Pair Problems;Automated Deduction - CADE-25;2015
5. Proving Operational Termination of Declarative Programs in General Logics;Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming - PPDP '14;2014