InforLorV4, Main, Merge, bibRecord, 007F86

ACID-unification is NEXPTIME-decidable

Identifieur interne : 007F86 ( Main/Merge ); précédent : 007F85; suivant : 007F87

ACID-unification is NEXPTIME-decidable

Auteurs : Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2003.

RBID : Pascal:04-0135390

Descripteurs français

Pascal (Inist)
- Décidabilité, Théorie équationnelle, Automate, Unification.

English descriptors

KwdEn :
- Automaton, Decidability, Equational theory, Unification.

Abstract

We consider the unification problem for the equational theory AC(U)ID obtained by adjoining a binary '*' which is distributive over an associative-commutative idempotent operator '+', possibly admitting a unit element U. We formulate the problem as a particular class of set constraints, and propose a method for solving it by using the dag automata introduced by W. Charatonik, that we enrich with labels for our purposes. AC(U)ID-unification is thus shown to be in NEXPTIME.

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

to stream PascalFrancis, to step Corpus: 000722
to stream PascalFrancis, to step Curation: 000319
to stream PascalFrancis, to step Checkpoint: 000727

Links to Exploration step

Pascal:04-0135390

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">ACID-unification is NEXPTIME-decidable</title>
<author><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LIFO </s1>
<s2>Orléans</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Centre-Val de Loire</region>
<region type="old region">Région Centre</region>
<settlement type="city">Orléans</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University at Albany-SUNY</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>University at Albany-SUNY</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA </s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0135390</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0135390 INIST</idno>
<idno type="RBID">Pascal:04-0135390</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000722</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000319</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000727</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000727</idno>
<idno type="wicri:doubleKey">0302-9743:2003:Anantharaman S:acid:unification:is</idno>
<idno type="wicri:Area/Main/Merge">007F86</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">ACID-unification is NEXPTIME-decidable</title>
<author><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LIFO </s1>
<s2>Orléans</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Centre-Val de Loire</region>
<region type="old region">Région Centre</region>
<settlement type="city">Orléans</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>University at Albany-SUNY</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>University at Albany-SUNY</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA </s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region">Grand Est</region>
<region type="old region">Lorraine (région)</region>
<settlement type="city">Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automaton</term>
<term>Decidability</term>
<term>Equational theory</term>
<term>Unification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Décidabilité</term>
<term>Théorie équationnelle</term>
<term>Automate</term>
<term>Unification</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We consider the unification problem for the equational theory AC(U)ID obtained by adjoining a binary '*' which is distributive over an associative-commutative idempotent operator '+', possibly admitting a unit element U. We formulate the problem as a particular class of set constraints, and propose a method for solving it by using the dag automata introduced by W. Charatonik, that we enrich with labels for our purposes. AC(U)ID-unification is thus shown to be in NEXPTIME.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>Centre-Val de Loire</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Région Centre</li>
</region>
<settlement><li>Nancy</li>
<li>Orléans</li>
</settlement>
</list>
<tree><country name="France"><region name="Centre-Val de Loire"><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
</region>
<name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name>
</country>
<country name="États-Unis"><noRegion><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
</noRegion>
</country>
</tree>
</affiliations>
</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 007F86 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007F86 | 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é=     Pascal:04-0135390
   |texte=   ACID-unification is NEXPTIME-decidable
}}

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

	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.

Serveur d'exploration sur la recherche en informatique en Lorraine

ACID-unification is NEXPTIME-decidable

ACID-unification is NEXPTIME-decidable

Source :

Descripteurs français

English descriptors

Abstract

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

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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