Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Termination of rewrite systems by elementary interpretations

Identifieur interne : 000676 ( Istex/Curation ); précédent : 000675; suivant : 000677

Termination of rewrite systems by elementary interpretations

Auteurs : Pierre Lescanne [France]

Source :

RBID : ISTEX:1DEAC91B4AA99508C78009430467484893CD8A83

English descriptors

Abstract

Abstract: We focus on termination proofs of rewrite systems, especially of rewrite systems containing associative and commutative operators. We prove their termination by elementary interpretations, more specifically, by functions defined by addition, multiplication and exponentiation. We discuss a method based on polynomial interpretations and propose an implementation of a mechanisation of the comparison of expressions built with polynomials and exponentials.

Url:
DOI: 10.1007/BF01214624

Links toward previous steps (curation, corpus...)


Links to Exploration step

ISTEX:1DEAC91B4AA99508C78009430467484893CD8A83

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">Termination of rewrite systems by elementary interpretations</title>
<author>
<name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation wicri:level="1">
<mods:affiliation>Centre de Recherche en Informatique de Nancy (CNRS) and INRIA-Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Centre de Recherche en Informatique de Nancy (CNRS) and INRIA-Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1">
<mods:affiliation>E-mail: Pierre.Lescanne@loria.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1DEAC91B4AA99508C78009430467484893CD8A83</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1007/BF01214624</idno>
<idno type="url">https://api.istex.fr/ark:/67375/1BB-NFZCJ5ZK-4/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000681</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000681</idno>
<idno type="wicri:Area/Istex/Curation">000676</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">Termination of rewrite systems by elementary interpretations</title>
<author>
<name sortKey="Lescanne, Pierre" sort="Lescanne, Pierre" uniqKey="Lescanne P" first="Pierre" last="Lescanne">Pierre Lescanne</name>
<affiliation wicri:level="1">
<mods:affiliation>Centre de Recherche en Informatique de Nancy (CNRS) and INRIA-Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>Centre de Recherche en Informatique de Nancy (CNRS) and INRIA-Lorraine, Campus Scientifique, BP 239, 54506, Vandœuvre-lès-Nancy</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1">
<mods:affiliation>E-mail: Pierre.Lescanne@loria.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="j">Formal Aspects of Computing</title>
<title level="j" type="sub">Applicable Formal Methods</title>
<title level="j" type="abbrev">Formal Aspects of Computing</title>
<idno type="ISSN">0934-5043</idno>
<idno type="eISSN">1433-299X</idno>
<imprint>
<publisher>Springer-Verlag</publisher>
<pubPlace>London</pubPlace>
<date type="published" when="1995-01-01">1995-01-01</date>
<biblScope unit="volume">7</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="77">77</biblScope>
<biblScope unit="page" to="90">90</biblScope>
</imprint>
<idno type="ISSN">0934-5043</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0934-5043</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Rewrite systems</term>
<term>Termination</term>
<term>Total connection</term>
<term>Well-foundedness</term>
</keywords>
<keywords scheme="Teeft" xml:lang="en">
<term>Adam cichon</term>
<term>Associative</term>
<term>Associativity</term>
<term>Automatic synthesis</term>
<term>Canonical</term>
<term>Commutative</term>
<term>Commutative operators</term>
<term>Commutativity</term>
<term>Completion procedure</term>
<term>Completion procedures</term>
<term>Data structure</term>
<term>Elementary functions</term>
<term>Elementary interpretations</term>
<term>Empty list</term>
<term>Equational theories</term>
<term>Exponent</term>
<term>Exponential</term>
<term>Fibonacci numbers</term>
<term>Formal aspects</term>
<term>Function symbol</term>
<term>Iterative factorial</term>
<term>Lescanne</term>
<term>Lncs</term>
<term>Monomial</term>
<term>Natural numbers</term>
<term>Number theoretic functions</term>
<term>Orme</term>
<term>Other hand</term>
<term>Other rules</term>
<term>Other words</term>
<term>Polynomial interpretations</term>
<term>Such orderings</term>
<term>Technical report</term>
<term>Termination</term>
<term>Theoretical computer science</term>
<term>Transition rules control</term>
<term>Unpublished manuscript</term>
<term>Uxyz</term>
</keywords>
</textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Abstract: We focus on termination proofs of rewrite systems, especially of rewrite systems containing associative and commutative operators. We prove their termination by elementary interpretations, more specifically, by functions defined by addition, multiplication and exponentiation. We discuss a method based on polynomial interpretations and propose an implementation of a mechanisation of the comparison of expressions built with polynomials and exponentials.</div>
</front>
</TEI>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000676 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000676 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Curation
   |type=    RBID
   |clé=     ISTEX:1DEAC91B4AA99508C78009430467484893CD8A83
   |texte=   Termination of rewrite systems by elementary interpretations
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022