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.

On Word Problems in Horn Theories

Identifieur interne : 000C37 ( Crin/Corpus ); précédent : 000C36; suivant : 000C38

On Word Problems in Horn Theories

Auteurs : E. Kounalis ; M. Rusinowitch

Source :

RBID : CRIN:kounalis91a

English descriptors

Abstract

We interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions so that the word problem can be decided by conditional normalization in some Horn theories. We also show how to prove theorems in the initial models of Horn theories.

Links to Exploration step

CRIN:kounalis91a

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" wicri:score="80">On Word Problems in Horn Theories</title>
</titleStmt>
<publicationStmt>
<idno type="RBID">CRIN:kounalis91a</idno>
<date when="1991" year="1991">1991</date>
<idno type="wicri:Area/Crin/Corpus">000C37</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">On Word Problems in Horn Theories</title>
<author>
<name sortKey="Kounalis, E" sort="Kounalis, E" uniqKey="Kounalis E" first="E." last="Kounalis">E. Kounalis</name>
</author>
<author>
<name sortKey="Rusinowitch, M" sort="Rusinowitch, M" uniqKey="Rusinowitch M" first="M." last="Rusinowitch">M. Rusinowitch</name>
</author>
</analytic>
<series>
<title level="j">Journal of Symbolic Computation</title>
<imprint>
<date when="1991" type="published">1991</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Horn theories</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en" wicri:score="1002">We interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions so that the word problem can be decided by conditional normalization in some Horn theories. We also show how to prove theorems in the initial models of Horn theories.</div>
</front>
</TEI>
<BibTex type="article">
<ref>kounalis91a</ref>
<crinnumber>91-R-173</crinnumber>
<category>1</category>
<equipe>EURECA</equipe>
<author>
<e>Kounalis, E.</e>
<e>Rusinowitch, M.</e>
</author>
<title>On Word Problems in Horn Theories</title>
<journal>Journal of Symbolic Computation</journal>
<year>1991</year>
<volume>11</volume>
<number>1-2</number>
<pages>113-127</pages>
<month>Feb</month>
<keywords>
<e>Horn theories</e>
</keywords>
<abstract>We interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions so that the word problem can be decided by conditional normalization in some Horn theories. We also show how to prove theorems in the initial models of Horn theories.</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 000C37 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 000C37 | 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:kounalis91a
   |texte=   On Word Problems in Horn Theories
}}

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