Sciweavers

7 search results - page 2 / 2
» Goal-Directed and Relative Dependency Pairs for Proving the ...
Sort
View
CADE
2001
Springer
14 years 5 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
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 whic...
Xavier Urbain
JAR
2006
87views more  JAR 2006»
13 years 5 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...