2005 | OriginalPaper | Buchkapitel
Orderings for Innermost Termination
verfasst von : Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio
Erschienen in: Term Rewriting and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper shows that the suitable orderings for proving innermost termination are characterized by the
innermost parallel monotonicity
,
IP-monotonicity
for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the
Recursive Path Ordering
is presented. This variant can be used (directly or as ingredient of the
Dependency Pairs
method) for proving innermost termination of non-terminating term rewrite systems.