Merge
Accueil
Racine
Merge
Exploration
Accueil
Racine
Accueil
Racine

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.

Equational Completion in Orded-sorted Algebras

Identifieur interne : 00E571 ( Main/Merge ); précédent : 00E570; suivant : 00E572

Equational Completion in Orded-sorted Algebras

Auteurs : I. Gnaedig ; C. Kirchner ; H. Kirchner

Source :

RBID : CRIN:gnaedig90a

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 toward previous steps (curation, corpus...)

Links to Exploration step

CRIN:gnaedig90a

Le 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>
<idno type="wicri:Area/Crin/Curation">000834</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000834</idno>
<idno type="wicri:Area/Crin/Checkpoint">003C36</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003C36</idno>
<idno type="wicri:Area/Main/Merge">00E571</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>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E571 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00E571 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     CRIN:gnaedig90a
   |texte=   Equational Completion in Orded-sorted Algebras
}}
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