Abstract
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules which allow us to perform termination proofs incrementally. Important results can be expressed in that new framework (regarding CE-termination for instance), and with help of π extendable orderings, we give effective new incremental methods for proving termination particularly suited for automation. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Urbain, X. (2001). Automated incremental termination proofs for hierarchically defined term rewriting systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2083 LNAI, pp. 485–498). Springer Verlag. https://doi.org/10.1007/3-540-45744-5_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
