TY - JOUR
T1 - Leanest quasi-orderings preliminary version
AU - Dershowitz, Nachum
AU - Ellerman, E. Castedo
PY - 2005
Y1 - 2005
N2 - 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 ordering of quasi-orderings, and provide sufficient conditions for the existence of a "leanest" ordering.
AB - 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 ordering of quasi-orderings, and provide sufficient conditions for the existence of a "leanest" ordering.
UR - http://www.scopus.com/inward/record.url?scp=24944466632&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-32033-3_4
DO - 10.1007/978-3-540-32033-3_4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:24944466632
SN - 0302-9743
VL - 3467
SP - 32
EP - 45
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
T2 - 16th International Conference on Term Rewriting and Applications, RTA 2005
Y2 - 19 April 2005 through 21 April 2005
ER -