ACID -Unification Is NEXPTIME-Decidable
Identifieur interne : 007B04 ( Main/Exploration ); précédent : 007B03; suivant : 007B05ACID -Unification Is NEXPTIME-Decidable
Auteurs : Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
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.
Url:
DOI: 10.1007/978-3-540-45138-9_11
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002222
- to stream Istex, to step Curation: 002192
- to stream Istex, to step Checkpoint: 001A94
- to stream Main, to step Merge: 007E83
- to stream PascalFrancis, to step Corpus: 000722
- to stream PascalFrancis, to step Curation: 000319
- to stream PascalFrancis, to step Checkpoint: 000727
- to stream Main, to step Merge: 007F86
- to stream Main, to step Curation: 007B04
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">ACID -Unification Is NEXPTIME-Decidable</title><author><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:92FE30C6E882B5C7BB46D303DFB5C11C5D304F0B</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/978-3-540-45138-9_11</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-GDWLV1F2-K/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002222</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002222</idno><idno type="wicri:Area/Istex/Curation">002192</idno><idno type="wicri:Area/Istex/Checkpoint">001A94</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001A94</idno><idno type="wicri:doubleKey">0302-9743:2003:Anantharaman S:acid:unification:is</idno><idno type="wicri:Area/Main/Merge">007E83</idno><idno type="wicri:source">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><idno type="wicri:Area/Main/Curation">007B04</idno><idno type="wicri:Area/Main/Exploration">007B04</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en"><hi rend="italic">ACID</hi>-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="1"><country xml:lang="fr">France</country><wicri:regionArea>LIFO – Orléans</wicri:regionArea></affiliation></author><author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>University at Albany–SUNY</wicri:regionArea></affiliation></author><author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA, Nancy</wicri:regionArea><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><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>Automate</term><term>Décidabilité</term><term>Théorie équationnelle</term><term>Unification</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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.</div></front></TEI><affiliations><list><country><li>France</li><li>États-Unis</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement></list><tree><country name="France"><noRegion><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name></noRegion><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/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007B04 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007B04 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:92FE30C6E882B5C7BB46D303DFB5C11C5D304F0B
|texte= ACID -Unification Is NEXPTIME-Decidable
}}
| This area was generated with Dilib version V0.6.33. |  |