Equational Completion in Orded-sorted Algebras
Identifieur interne : 000834 ( Crin/Corpus ); précédent : 000833; suivant : 000835Equational Completion in Orded-sorted Algebras
Auteurs : I. Gnaedig ; C. Kirchner ; H. KirchnerSource :
- Theoretical Computer Science ; 1990.
English descriptors
Abstract
Using the most recent tools on proof algebras and proof orderings, we describe and prove completion procedures for equational term rewriting systems in order-sorted algebras. Problems specific to order-sorted equational logic are emphasized. Complete proofs of our results are given.
Links to Exploration step
CRIN:gnaedig90aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="240">Equational Completion in Orded-sorted Algebras</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:gnaedig90a</idno>
<date when="1990" year="1990">1990</date>
<idno type="wicri:Area/Crin/Corpus">000834</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Equational Completion in Orded-sorted Algebras</title>
<author><name sortKey="Gnaedig, I" sort="Gnaedig, I" uniqKey="Gnaedig I" first="I." last="Gnaedig">I. Gnaedig</name>
</author>
<author><name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
</author>
<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="1990" type="published">1990</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>completion</term>
<term>order-sorted deduction</term>
<term>order-sorted rewriting</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="334">Using the most recent tools on proof algebras and proof orderings, we describe and prove completion procedures for equational term rewriting systems in order-sorted algebras. Problems specific to order-sorted equational logic are emphasized. Complete proofs of our results are given.</div>
</front>
</TEI>
<BibTex type="article"><ref>gnaedig90a</ref>
<crinnumber>88-R-037</crinnumber>
<category>1</category>
<equipe>INCONNUE</equipe>
<author><e>Gnaedig, I.</e>
<e>Kirchner, C.</e>
<e>Kirchner, H.</e>
</author>
<title>Equational Completion in Orded-sorted Algebras</title>
<journal>Theoretical Computer Science</journal>
<year>1990</year>
<volume>72</volume>
<number>2-3</number>
<pages>169-202</pages>
<month>May</month>
<keywords><e>order-sorted deduction</e>
<e>order-sorted rewriting</e>
<e>completion</e>
</keywords>
<abstract>Using the most recent tools on proof algebras and proof orderings, we describe and prove completion procedures for equational term rewriting systems in order-sorted algebras. Problems specific to order-sorted equational logic are emphasized. Complete proofs of our results are given.</abstract>
</BibTex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000834 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 000834 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Crin |étape= Corpus |type= RBID |clé= CRIN:gnaedig90a |texte= Equational Completion in Orded-sorted Algebras }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |