Result: Leanest quasi-orderings
Title:
Leanest quasi-orderings
Authors:
Source:
16th international conference on rewriting techniques and applicationsInformation and computation (Print). 205(4):535-556
Publisher Information:
San Diego, CA: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Divers, Miscellaneous, Borne électrique, Termination, Borne eléctrico, Condition existence, Existence condition, Condición existencia, Condition suffisante, Sufficient condition, Condición suficiente, Inclusion, Inclusión, Informatique théorique, Computer theory, Informática teórica, Relation ordre, Ordering, Relación orden, Réécriture, Rewriting, Reescritura, 68Q42, Ordre partiel, Terme, Terminaison, Lexicographic path ordering, Quasi-ordering, Well-quasi-ordering
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computer Science, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel
ISSN:
0890-5401
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18651353
Database:
PASCAL Archive
Further Information
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.