TY  - INPR
A1  - Gramlich, Bernhard
T1  - New Abstract Criteria for Termination and Confluence of Conditional Rewrite Systems
N2  - We consider the problem of verifying confluence and termination of conditionalterm rewriting systems (TRSs). For unconditional TRSs the critical pair lemmaholds which enables a finite test for confluence of (finite) terminating systems.And for ensuring termination of unconditional TRSs a couple of methods forconstructing appropiate well-founded term orderings are known. If however ter-mination is not guaranteed then proving confluence is much more difficult. Re-cently we have obtained some interesting results for unconditional TRSs whichprovide sufficient criteria for termination plus confluence in terms of restrictedtermination and confluence properties. In particular, we have shown that anyinnermost terminating and locally confluent overlay system is complete, i.e. ter-minating and confluent. Here we generalize our approach to the conditional caseand show how to solve the additional complications due to the presence of con-ditions in the rules. Our main result can be stated as follows: Any conditionalTRS which is an innermost terminating semantical overlay system such that all(conditional) critical pairs are joinable is complete.
T3  - SEKI Report - 93,17 
KW  - Term rewriting systems
KW  - confluence
KW  - termination
KW  - weak termination
KW  - innermost termination
KW  - modularity
KW  - disjoint union
KW  - combined systems with sha
Y1  - 1999
UR  - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/356
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-3276
ER  -