Relative Termination
نویسنده
چکیده
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite system relatively terminates, one may reuse the common termination quasiorderings. Further proof methods become available by the cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion of relative termination is finally demonstrated by a proof of completeness for "reduced narrowing" and "normal narrowing", two attractive variants of the narrowing procedure.
منابع مشابه
Fakultät für Informatik Relative Termination
"Relative termination" is a property that generalizes both termination and "termination modulo". In order to prove that a term rewrite Systemrelatively termmates, one may reuse the common termination quasiordenngs. Further proof methods become available by the Cooperation property. Relative termination sets up new proof techniques for termination and confluence. The usefulness of the notion of ...
متن کاملStructure-radical scavenging activity relationships of hydroxytoluene derivatives
Research works proposed that radical scavenging activity of flavonoids is due to ring B, andthe remaining part of the molecule can be disregarded. Thus the objective of this work is toobserve whether hydroxytoluenes account the radical scavenging activity of flavonoid and toestablish structural requirements for their activity (as they showed appreciable activity) andelucidate a comprehensive me...
متن کاملReducing Relative Termination to Dependency Pair Problems
Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Proble...
متن کاملGoal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new result for proving relative termination in terms of a dependency pair problem. Both contributions put together allow us to define a simple and powerful approach to analyzing the termination of narrowing, an extension of ...
متن کاملWST ’ 04 7 th International Workshop on Termination
Partial Evaluation for Termination Analysis . . . . . . . . . . . . . . . . . . . . . 47 Lior Tamary, Michael Codish Relative Termination in Term Rewriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51 Hans Zantema
متن کامل