Leanest quasi-orderings

Authors:
Nachum Dershowitz;E. Castedo Ellerman
Affiliations:
School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel;40 Moreland Ave., Lexington, MA 02421, USA
Venue:
Information and Computation
Year:
2007

Citing 6
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Extension functions for multiset orderings

Information Processing Letters
A geometrical approach to multiset orderings

Theoretical Computer Science
Proving termination with multiset orderings

Communications of the ACM
Ordinal Arithmetic with List Structures

TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
On termination of meta-programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some desired traits. Unfortunately, a minimum in terms of set inclusion can be non-existent even when an intuitive ''minimum'' exists. We suggest an alternative to set inclusion, called ''leanness'', show that leanness is a partial order on quasi-orderings, and provide sufficient conditions for the existence of a ''leanest'' member of a set of total well-founded quasi-orderings.