We investigate • how current techniques for proving termination for term rewriting systems (TRSs) essentially use relative termination, although not always stated explicitly, • how using relative termination is helpful for proving termination in a modular way, • which techniques for proving termination easily extend to proving relative termination, • how for some applications relative termination is the natural underlying concept, justifying studying relative termination in itself.
|Title of host publication||Proceedings 7th International Workshop on Termination (WST-04, Aachen, Germany, June 1-2, 2004), Aachener Informatik Berichte AIB-2004-07|
|Editors||M. Codish, A. Middelkoop|
|Place of Publication||Aachen, Germany|
|Publication status||Published - 2004|