Author:
Sternagel Christian,Middeldorp Aart
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Lecture Notes in Computer Science;N. Eén,2004
4. Endrullis, J.: Jambox (2005), http://joerg.endrullis.de
5. Lecture Notes in Artificial Intelligence;J. Endrullis,2006
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Using linear constraints for logic program termination analysis;Theory and Practice of Logic Programming;2016-03-31
2. Datalog and Logic Databases;Synthesis Lectures on Data Management;2015-11-05
3. The Certification Problem Format;Electronic Proceedings in Theoretical Computer Science;2014-10-29
4. Checking termination of bottom-up evaluation of logic programs with function symbols;Theory and Practice of Logic Programming;2014-08-13
5. Modular Complexity Analysis for Term Rewriting;Logical Methods in Computer Science;2014-04-01