Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes
Identifieur interne : 003D73 ( Crin/Checkpoint ); précédent : 003D72; suivant : 003D74Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes
Auteurs : H. KirchnerSource :
- Theoretical Computer Science ; 1989.
English descriptors
- KwdEn :
Abstract
Infinite sets of rewrite rules may be generated for example by completion of term rewriting systems or by a narrowing process for solving equations in equational theories. This is a severe limitation to the practical use of these processes. We propose in this paper a notion of schematization for an infinite set of rewrite rules. We show how to use a schematization for deciding the validity or satisfiability of an equation in the equational theory defined by the infinite set of rules, provided the schematization is sound and complete. A process to build a complete schematization from a sound one is proposed.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:kirchner89aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="314">Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes</title></titleStmt><publicationStmt><idno type="RBID">CRIN:kirchner89a</idno><date when="1989" year="1989">1989</date><idno type="wicri:Area/Crin/Corpus">000725</idno><idno type="wicri:Area/Crin/Curation">000725</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000725</idno><idno type="wicri:Area/Crin/Checkpoint">003D73</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003D73</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes</title><author><name sortKey="Kirchner, H" sort="Kirchner, H" uniqKey="Kirchner H" first="H." last="Kirchner">H. Kirchner</name></author></analytic><series><title level="j">Theoretical Computer Science</title><imprint><date when="1989" type="published">1989</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>completion</term><term>divergence of schematization</term><term>rewriting</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1901">Infinite sets of rewrite rules may be generated for example by completion of term rewriting systems or by a narrowing process for solving equations in equational theories. This is a severe limitation to the practical use of these processes. We propose in this paper a notion of schematization for an infinite set of rewrite rules. We show how to use a schematization for deciding the validity or satisfiability of an equation in the equational theory defined by the infinite set of rules, provided the schematization is sound and complete. A process to build a complete schematization from a sound one is proposed.</div></front></TEI><BibTex type="article"><ref>kirchner89a</ref><crinnumber>88-R-149</crinnumber><category>1</category><equipe>INCONNUE</equipe><author><e>Kirchner, H.</e></author><title>Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes</title><journal>Theoretical Computer Science</journal><year>1989</year><volume>67</volume><number>2-3</number><pages>303-332</pages><month>Oct</month><keywords><e>rewriting</e><e>divergence of schematization</e><e>completion</e></keywords><abstract>Infinite sets of rewrite rules may be generated for example by completion of term rewriting systems or by a narrowing process for solving equations in equational theories. This is a severe limitation to the practical use of these processes. We propose in this paper a notion of schematization for an infinite set of rewrite rules. We show how to use a schematization for deciding the validity or satisfiability of an equation in the equational theory defined by the infinite set of rules, provided the schematization is sound and complete. A process to build a complete schematization from a sound one is proposed.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003D73 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 003D73 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:kirchner89a
|texte= Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes
}}
| This area was generated with Dilib version V0.6.33. |  |