Abstract
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area in the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overcome these obstacles. We provide ample numerical data supporting our ideas.
Cite
CITATION STYLE
Hirokawa, N., & Middeldorp, A. (2003). Automating the dependency pair method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 32–46). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
