InforLorV4, PascalFrancis, Corpus, bibRecord, 000722

ACID-unification is NEXPTIME-decidable

Identifieur interne : 000722 ( PascalFrancis/Corpus ); précédent : 000721; suivant : 000723

ACID-unification is NEXPTIME-decidable

Auteurs : Siva Anantharaman ; Paliath Narendran ; Michael Rusinowitch

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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2747`
A08	`01`	`1`	`ENG`	`@1 ACID-unification is NEXPTIME-decidable`
A09	`01`	`1`	`ENG`	`@1 MFCS 2003 : mathematical foundations of computer science 2003 : Bratislava, 25-29 August 2003`
A11	`01`	`1`		`@1 ANANTHARAMAN (Siva)`
A11	`02`	`1`		`@1 NARENDRAN (Paliath)`
A11	`03`	`1`		`@1 RUSINOWITCH (Michael)`
A12	`01`	`1`		`@1 ROVAN (Branislav) @9 ed.`
A12	`02`	`1`		`@1 VOJTAS (Peter) @9 ed.`
A14	`01`			`@1 LIFO @2 Orléans @3 FRA @Z 1 aut.`
A14	`02`			`@1 University at Albany-SUNY @3 USA @Z 2 aut.`
A14	`03`			`@1 LORIA @2 Nancy @3 FRA @Z 3 aut.`
A20				`@1 169-178`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40671-9`
A43	`01`			`@1 INIST @2 16343 @5 354000117777950110`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 13 ref.`
A47	`01`	`1`		`@0 04-0135390`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 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.`
C02	`01`	`X`		`@0 001D02A05`
C03	`01`	`X`	`FRE`	`@0 Décidabilité @5 01`
C03	`01`	`X`	`ENG`	`@0 Decidability @5 01`
C03	`01`	`X`	`SPA`	`@0 Decidibilidad @5 01`
C03	`02`	`X`	`FRE`	`@0 Théorie équationnelle @5 02`
C03	`02`	`X`	`ENG`	`@0 Equational theory @5 02`
C03	`02`	`X`	`SPA`	`@0 Teoría ecuaciónal @5 02`
C03	`03`	`X`	`FRE`	`@0 Automate @5 03`
C03	`03`	`X`	`ENG`	`@0 Automaton @5 03`
C03	`03`	`X`	`SPA`	`@0 Autómata @5 03`
C03	`04`	`X`	`FRE`	`@0 Unification @5 04`
C03	`04`	`X`	`ENG`	`@0 Unification @5 04`
C03	`04`	`X`	`SPA`	`@0 Unificación @5 04`
N21				`@1 089`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 Mathematical foundations of computer science. International symposium @2 28 @3 Bratislava SVK @4 2003-08-25`

Format Inist (serveur)

NO :	PASCAL 04-0135390 INIST
ET :	ACID-unification is NEXPTIME-decidable
AU :	ANANTHARAMAN (Siva); NARENDRAN (Paliath); RUSINOWITCH (Michael); ROVAN (Branislav); VOJTAS (Peter)
AF :	LIFO /Orléans/France (1 aut.); University at Albany-SUNY/Etats-Unis (2 aut.); LORIA /Nancy/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2747; Pp. 169-178; Bibl. 13 ref.
LA :	Anglais
EA :	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.
CC :	001D02A05
FD :	Décidabilité; Théorie équationnelle; Automate; Unification
ED :	Decidability; Equational theory; Automaton; Unification
SD :	Decidibilidad; Teoría ecuaciónal; Autómata; Unificación
LO :	INIST-16343.354000117777950110
ID :	04-0135390

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><inist:fA14 i1="01"><s1>LIFO </s1>
<s2>Orléans</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation><inist:fA14 i1="02"><s1>University at Albany-SUNY</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA </s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</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>
</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><inist:fA14 i1="01"><s1>LIFO </s1>
<s2>Orléans</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation><inist:fA14 i1="02"><s1>University at Albany-SUNY</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michael" last="Rusinowitch">Michael Rusinowitch</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA </s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</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>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2747</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>ACID-unification is NEXPTIME-decidable</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>MFCS 2003 : mathematical foundations of computer science 2003 : Bratislava, 25-29 August 2003</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>ANANTHARAMAN (Siva)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>NARENDRAN (Paliath)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>RUSINOWITCH (Michael)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ROVAN (Branislav)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VOJTAS (Peter)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LIFO </s1>
<s2>Orléans</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>University at Albany-SUNY</s1>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>LORIA </s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>169-178</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40671-9</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117777950110</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>13 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0135390</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Decidability</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Automate</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Automaton</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Autómata</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Unification</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Unification</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Unificación</s0>
<s5>04</s5>
</fC03>
<fN21><s1>089</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>Mathematical foundations of computer science. International symposium</s1>
<s2>28</s2>
<s3>Bratislava SVK</s3>
<s4>2003-08-25</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0135390 INIST</NO>
<ET>ACID-unification is NEXPTIME-decidable</ET>
<AU>ANANTHARAMAN (Siva); NARENDRAN (Paliath); RUSINOWITCH (Michael); ROVAN (Branislav); VOJTAS (Peter)</AU>
<AF>LIFO /Orléans/France (1 aut.); University at Albany-SUNY/Etats-Unis (2 aut.); LORIA /Nancy/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2747; Pp. 169-178; Bibl. 13 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02A05</CC>
<FD>Décidabilité; Théorie équationnelle; Automate; Unification</FD>
<ED>Decidability; Equational theory; Automaton; Unification</ED>
<SD>Decidibilidad; Teoría ecuaciónal; Autómata; Unificación</SD>
<LO>INIST-16343.354000117777950110</LO>
<ID>04-0135390</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000722 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |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

Notice en format standard (ISO 2709)

Format Inist (serveur)

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