InforLorV4, PascalFrancis, Corpus, bibRecord, 000699

Unification modulo ACUI plus homomorphisms/distributivity

Identifieur interne : 000699 ( PascalFrancis/Corpus ); précédent : 000698; suivant : 000700

Unification modulo ACUI plus homomorphisms/distributivity

Auteurs : Siva Anantharaman ; Paliath Narendran ; Michael Rusinowitch

Source :

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

RBID : Pascal:04-0200275

Descripteurs français

Pascal (Inist)
- Démonstration automatique, Unification, Homomorphisme, Décidabilité, Commutativité, Associativité.

English descriptors

KwdEn :
- Associativity, Automatic proving, Commutativity, Decidability, Homomorphism, Unification.

Abstract

In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '*' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID_l-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '*' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '*' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '*' are added on to ACUID, the unification problem becomes undecidable.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2741`
A08	`01`	`1`	`ENG`	`@1 Unification modulo ACUI plus homomorphisms/distributivity`
A09	`01`	`1`	`ENG`	`@1 Automated deduction - CADE-19 : Miami Beach FL, 28 July - 2 August 2003`
A11	`01`	`1`		`@1 ANANTHARAMAN (Siva)`
A11	`02`	`1`		`@1 NARENDRAN (Paliath)`
A11	`03`	`1`		`@1 RUSINOWITCH (Michael)`
A12	`01`	`1`		`@1 BAADER (Franz) @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 442-457`
A21				`@1 2003`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-40559-3`
A43	`01`			`@1 INIST @2 16343 @5 354000117776390350`
A44				`@0 0000 @1 © 2004 INIST-CNRS. All rights reserved.`
A45				`@0 14 ref.`
A47	`01`	`1`		`@0 04-0200275`
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 In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID_l-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '' are added on to ACUID, the unification problem becomes undecidable.
C02	`01`	`X`		`@0 001D02B01`
C02	`02`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Démonstration automatique @5 01`
C03	`01`	`X`	`ENG`	`@0 Automatic proving @5 01`
C03	`01`	`X`	`SPA`	`@0 Demostración automática @5 01`
C03	`02`	`X`	`FRE`	`@0 Unification @5 02`
C03	`02`	`X`	`ENG`	`@0 Unification @5 02`
C03	`02`	`X`	`SPA`	`@0 Unificación @5 02`
C03	`03`	`X`	`FRE`	`@0 Homomorphisme @5 03`
C03	`03`	`X`	`ENG`	`@0 Homomorphism @5 03`
C03	`03`	`X`	`SPA`	`@0 Homomorfismo @5 03`
C03	`04`	`X`	`FRE`	`@0 Décidabilité @5 04`
C03	`04`	`X`	`ENG`	`@0 Decidability @5 04`
C03	`04`	`X`	`SPA`	`@0 Decidibilidad @5 04`
C03	`05`	`X`	`FRE`	`@0 Commutativité @5 11`
C03	`05`	`X`	`ENG`	`@0 Commutativity @5 11`
C03	`05`	`X`	`SPA`	`@0 Conmutatividad @5 11`
C03	`06`	`X`	`FRE`	`@0 Associativité @4 CD @5 96`
C03	`06`	`X`	`ENG`	`@0 Associativity @4 CD @5 96`
N21				`@1 138`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International conference on automated deduction @2 19 @3 Miami Beach FL USA @4 2003-07-28`

Format Inist (serveur)

NO :	PASCAL 04-0200275 INIST
ET :	Unification modulo ACUI plus homomorphisms/distributivity
AU :	ANANTHARAMAN (Siva); NARENDRAN (Paliath); RUSINOWITCH (Michael); BAADER (Franz)
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. 2741; Pp. 442-457; Bibl. 14 ref.
LA :	Anglais
EA :	In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID_l-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '' are added on to ACUID, the unification problem becomes undecidable.
CC :	001D02B01; 001D02A04
FD :	Démonstration automatique; Unification; Homomorphisme; Décidabilité; Commutativité; Associativité
ED :	Automatic proving; Unification; Homomorphism; Decidability; Commutativity; Associativity
SD :	Demostración automática; Unificación; Homomorfismo; Decidibilidad; Conmutatividad
LO :	INIST-16343.354000117776390350
ID :	04-0200275

Links to Exploration step

Pascal:04-0200275

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Unification modulo ACUI plus homomorphisms/distributivity</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-0200275</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0200275 INIST</idno>
<idno type="RBID">Pascal:04-0200275</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000699</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Unification modulo ACUI plus homomorphisms/distributivity</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>Associativity</term>
<term>Automatic proving</term>
<term>Commutativity</term>
<term>Decidability</term>
<term>Homomorphism</term>
<term>Unification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Démonstration automatique</term>
<term>Unification</term>
<term>Homomorphisme</term>
<term>Décidabilité</term>
<term>Commutativité</term>
<term>Associativité</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '*' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID<sub>l</sub>
-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '*' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '*' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '*' are added on to ACUID, the unification problem becomes undecidable.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2741</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Unification modulo ACUI plus homomorphisms/distributivity</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Automated deduction - CADE-19 : Miami Beach FL, 28 July - 2 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>BAADER (Franz)</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>442-457</s1>
</fA20>
<fA21><s1>2003</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-40559-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117776390350</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>14 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>04-0200275</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>In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '*' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID<sub>l</sub>
-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '*' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '*' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '*' are added on to ACUID, the unification problem becomes undecidable.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B01</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Unification</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Unification</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Unificación</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Homomorphisme</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Homomorphism</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Homomorfismo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Décidabilité</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Decidability</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Decidibilidad</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Commutativité</s0>
<s5>11</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Commutativity</s0>
<s5>11</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Conmutatividad</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Associativité</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Associativity</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>138</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on automated deduction</s1>
<s2>19</s2>
<s3>Miami Beach FL USA</s3>
<s4>2003-07-28</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 04-0200275 INIST</NO>
<ET>Unification modulo ACUI plus homomorphisms/distributivity</ET>
<AU>ANANTHARAMAN (Siva); NARENDRAN (Paliath); RUSINOWITCH (Michael); BAADER (Franz)</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. 2741; Pp. 442-457; Bibl. 14 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper, we consider the unification problem over theories that are extensions of ACI or ACUI, obtained by adding finitely many homomorphism symbols, or a symbol '*' that distributes over the ACUI-symbol denoted '+'. We first show that when we adjoin a set of commuting homomorphisms to ACUI, unification is undecidable. We then consider the ACUID<sub>l</sub>
-unification problem, i.e., unification modulo ACUI plus left-distributivity of a given '*' w.r.t. '+', and prove its NEXPTIME-decidability. When we assume the symbol '*' to be 2-sided distributive w.r.t. '+', we get the theory ACUID, for which the unification problem remains decidable. But when equations of associativity-commutativity, or just of associativity, on '*' are added on to ACUID, the unification problem becomes undecidable.</EA>
<CC>001D02B01; 001D02A04</CC>
<FD>Démonstration automatique; Unification; Homomorphisme; Décidabilité; Commutativité; Associativité</FD>
<ED>Automatic proving; Unification; Homomorphism; Decidability; Commutativity; Associativity</ED>
<SD>Demostración automática; Unificación; Homomorfismo; Decidibilidad; Conmutatividad</SD>
<LO>INIST-16343.354000117776390350</LO>
<ID>04-0200275</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 000699 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000699 | 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-0200275
   |texte=   Unification modulo ACUI plus homomorphisms/distributivity
}}

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

Unification modulo ACUI plus homomorphisms/distributivity

Unification modulo ACUI plus homomorphisms/distributivity

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