A proof of weak termination providing the right way to terminate
Identifieur interne :
000532 ( PascalFrancis/Corpus );
précédent :
000531;
suivant :
000533
A proof of weak termination providing the right way to terminate
Auteurs : Olivier Fissore ;
Isabelle Gnaedig ;
Hélène KirchnerSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2005.
RBID : Pascal:05-0361907
Descripteurs français
English descriptors
Abstract
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 3407 |
|---|
| A08 | 01 | 1 | ENG | @1 A proof of weak termination providing the right way to terminate |
|---|
| A09 | 01 | 1 | ENG | @1 Theoretical aspects of computing - ICTAC 2004 : Guiyang, 20-24 September 2004, revised selected papers |
|---|
| A11 | 01 | 1 | | @1 FISSORE (Olivier) |
|---|
| A11 | 02 | 1 | | @1 GNAEDIG (Isabelle) |
|---|
| A11 | 03 | 1 | | @1 KIRCHNER (Hélène) |
|---|
| A12 | 01 | 1 | | @1 LIU (Zhiming) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 ARAKI (Keijiro) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA-INRIA & LORIA-CNRS, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. |
|---|
| A20 | | | | @1 356-371 |
|---|
| A21 | | | | @1 2005 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-25304-1 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000124475210240 |
|---|
| A44 | | | | @0 0000 @1 © 2005 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 20 ref. |
|---|
| A47 | 01 | 1 | | @0 05-0361907 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations. |
|---|
| C02 | 01 | X | | @0 001D02 |
|---|
| C03 | 01 | X | FRE | @0 Système expert @5 06 |
|---|
| C03 | 01 | X | ENG | @0 Expert system @5 06 |
|---|
| C03 | 01 | X | SPA | @0 Sistema experto @5 06 |
|---|
| C03 | 02 | X | FRE | @0 Induction @5 07 |
|---|
| C03 | 02 | X | ENG | @0 Induction @5 07 |
|---|
| C03 | 02 | X | SPA | @0 Inducción @5 07 |
|---|
| C03 | 03 | 3 | FRE | @0 Système réécriture @5 08 |
|---|
| C03 | 03 | 3 | ENG | @0 Rewriting systems @5 08 |
|---|
| C03 | 04 | X | FRE | @0 Abstraction @5 18 |
|---|
| C03 | 04 | X | ENG | @0 Abstraction @5 18 |
|---|
| C03 | 04 | X | SPA | @0 Abstracción @5 18 |
|---|
| C03 | 05 | X | FRE | @0 Problème terminaison @5 23 |
|---|
| C03 | 05 | X | ENG | @0 Termination problem @5 23 |
|---|
| C03 | 05 | X | SPA | @0 Problema terminación @5 23 |
|---|
| C03 | 06 | X | FRE | @0 Base connaissance @5 24 |
|---|
| C03 | 06 | X | ENG | @0 Knowledge base @5 24 |
|---|
| C03 | 06 | X | SPA | @0 Base conocimiento @5 24 |
|---|
| C03 | 07 | X | FRE | @0 Surréduction @5 25 |
|---|
| C03 | 07 | X | ENG | @0 Narrowing(logics) @5 25 |
|---|
| C03 | 07 | X | SPA | @0 Sobrereducción @5 25 |
|---|
| N21 | | | | @1 248 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Theoretical aspects of computing. International colloquium @2 1 @3 Guiyang CHN @4 2004-09-20 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 05-0361907 INIST |
|---|
| ET : | A proof of weak termination providing the right way to terminate |
|---|
| AU : | FISSORE (Olivier); GNAEDIG (Isabelle); KIRCHNER (Hélène); LIU (Zhiming); ARAKI (Keijiro) |
|---|
| AF : | LORIA-INRIA & LORIA-CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3407; Pp. 356-371; Bibl. 20 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations. |
|---|
| CC : | 001D02 |
|---|
| FD : | Système expert; Induction; Système réécriture; Abstraction; Problème terminaison; Base connaissance; Surréduction |
|---|
| ED : | Expert system; Induction; Rewriting systems; Abstraction; Termination problem; Knowledge base; Narrowing(logics) |
|---|
| SD : | Sistema experto; Inducción; Abstracción; Problema terminación; Base conocimiento; Sobrereducción |
|---|
| LO : | INIST-16343.354000124475210240 |
|---|
| ID : | 05-0361907 |
|---|
Links to Exploration step
Pascal:05-0361907
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A proof of weak termination providing the right way to terminate</title>
<author><name sortKey="Fissore, Olivier" sort="Fissore, Olivier" uniqKey="Fissore O" first="Olivier" last="Fissore">Olivier Fissore</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0361907</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0361907 INIST</idno>
<idno type="RBID">Pascal:05-0361907</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000532</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A proof of weak termination providing the right way to terminate</title>
<author><name sortKey="Fissore, Olivier" sort="Fissore, Olivier" uniqKey="Fissore O" first="Olivier" last="Fissore">Olivier Fissore</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Gnaedig, Isabelle" sort="Gnaedig, Isabelle" uniqKey="Gnaedig I" first="Isabelle" last="Gnaedig">Isabelle Gnaedig</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2005">2005</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abstraction</term>
<term>Expert system</term>
<term>Induction</term>
<term>Knowledge base</term>
<term>Narrowing(logics)</term>
<term>Rewriting systems</term>
<term>Termination problem</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Système expert</term>
<term>Induction</term>
<term>Système réécriture</term>
<term>Abstraction</term>
<term>Problème terminaison</term>
<term>Base connaissance</term>
<term>Surréduction</term>
</keywords><front><div type="abstract" xml:lang="en">We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>3407</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A proof of weak termination providing the right way to terminate</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Theoretical aspects of computing - ICTAC 2004 : Guiyang, 20-24 September 2004, revised selected papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>FISSORE (Olivier)</s1>
</fA11><fA11 i1="02" i2="1"><s1>GNAEDIG (Isabelle)</s1>
</fA11><fA11 i1="03" i2="1"><s1>KIRCHNER (Hélène)</s1>
</fA11><fA12 i1="01" i2="1"><s1>LIU (Zhiming)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>ARAKI (Keijiro)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA-INRIA & LORIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>356-371</s1>
</fA20><fA21><s1>2005</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-25304-1</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000124475210240</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>20 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>05-0361907</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Système expert</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Expert system</s0>
<s5>06</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Sistema experto</s0>
<s5>06</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Induction</s0>
<s5>07</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Induction</s0>
<s5>07</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Inducción</s0>
<s5>07</s5>
</fC03><fC03 i1="03" i2="3" l="FRE"><s0>Système réécriture</s0>
<s5>08</s5>
</fC03><fC03 i1="03" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>08</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Abstraction</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Abstraction</s0>
<s5>18</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Abstracción</s0>
<s5>18</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Problème terminaison</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Termination problem</s0>
<s5>23</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Problema terminación</s0>
<s5>23</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Base connaissance</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Knowledge base</s0>
<s5>24</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Base conocimiento</s0>
<s5>24</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Surréduction</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Narrowing(logics)</s0>
<s5>25</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Sobrereducción</s0>
<s5>25</s5>
</fC03><fN21><s1>248</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Theoretical aspects of computing. International colloquium</s1>
<s2>1</s2>
<s3>Guiyang CHN</s3>
<s4>2004-09-20</s4>
</fA30><server><NO>PASCAL 05-0361907 INIST</NO>
<ET>A proof of weak termination providing the right way to terminate</ET>
<AU>FISSORE (Olivier); GNAEDIG (Isabelle); KIRCHNER (Hélène); LIU (Zhiming); ARAKI (Keijiro)</AU>
<AF>LORIA-INRIA & LORIA-CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2005; Vol. 3407; Pp. 356-371; Bibl. 20 ref.</SO>
<LA>Anglais</LA>
<EA>We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of sub-terms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.</EA>
<CC>001D02</CC>
<FD>Système expert; Induction; Système réécriture; Abstraction; Problème terminaison; Base connaissance; Surréduction</FD>
<ED>Expert system; Induction; Rewriting systems; Abstraction; Termination problem; Knowledge base; Narrowing(logics)</ED>
<SD>Sistema experto; Inducción; Abstracción; Problema terminación; Base conocimiento; Sobrereducción</SD>
<LO>INIST-16343.354000124475210240</LO>
<ID>05-0361907</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000532 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000532 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:05-0361907
|texte= A proof of weak termination providing the right way to terminate
}}
| 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 |  |
