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.

Completion for Unification

Identifieur interne : 00E819 ( Main/Merge ); précédent : 00E818; suivant : 00E820

Completion for Unification

Auteurs : N. Doggaz ; C. Kirchner

Source :

RBID : CRIN:doggaz89a

English descriptors

Abstract

Syntactic theories have the nice property that a unification algorithm may be computed directly from the form of the axioms of a specific presentation, called resolvant, of the theory. In this work we present and prove a completion algorithm that, for a given presentation, returns whenever it terminates, a resolvant set of axioms.

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

Links to Exploration step

CRIN:doggaz89a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="343">Completion for Unification</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:doggaz89a</idno>
<date when="1989" year="1989">1989</date>
<idno type="wicri:Area/Crin/Corpus">000809</idno>
<idno type="wicri:Area/Crin/Curation">000809</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000809</idno>
<idno type="wicri:Area/Crin/Checkpoint">003D67</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">003D67</idno>
<idno type="wicri:Area/Main/Merge">00E819</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Completion for Unification</title>
<author>
<name sortKey="Doggaz, N" sort="Doggaz, N" uniqKey="Doggaz N" first="N." last="Doggaz">N. Doggaz</name>
</author>
<author>
<name sortKey="Kirchner, C" sort="Kirchner, C" uniqKey="Kirchner C" first="C." last="Kirchner">C. Kirchner</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>completion</term>
<term>equational logic</term>
<term>unification</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="1302">Syntactic theories have the nice property that a unification algorithm may be computed directly from the form of the axioms of a specific presentation, called resolvant, of the theory. In this work we present and prove a completion algorithm that, for a given presentation, returns whenever it terminates, a resolvant set of axioms.</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 00E819 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00E819 | 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:doggaz89a
   |texte=   Completion for Unification
}}
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