InforLorV4, Main, Merge, bibRecord, 00A623

Congruence closure modulo associativity and commutativity

Identifieur interne : 00A623 ( Main/Merge ); précédent : 00A622; suivant : 00A624

Congruence closure modulo associativity and commutativity

Auteurs : L. Bachmair [États-Unis] ; I. V. Ramakrishnan [États-Unis] ; A. Tiwari [États-Unis] ; L. Vigneron [France]

Source :

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

RBID : Pascal:00-0325649

Descripteurs français

Pascal (Inist)
- Programmation logique, Optimisation programme, Système réécriture, Règle décision.

English descriptors

KwdEn :
- Decision rule, Logical programming, Program optimization, Rewriting systems.

Abstract

We introduce the notion of an associative-commutative congruence closure and show how such closures can be constructed via completion-like transition rules. This method is based on combining completion algorithms for theories over disjoint signatures to produce a convergent rewrite system over an extended signature. This approach can also be used to solve the word problem for ground AC-theories without the need for AC-simplification orderings tptal on ground terms. Associative-commutative congruence closure provides a novel way to construct a convergent rewrite system for a ground AC-theory. This is done by transforming an AC-congruence closure, which is described by rewrite rules over an extended signature, to a rewrite system over the original signature. The set of rewrite rules thus obtained is convergent with respect to a new and simpler notion of associative-commutative reduction.

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

to stream PascalFrancis, to step Corpus: 000A41
to stream PascalFrancis, to step Curation: 000041
to stream PascalFrancis, to step Checkpoint: 000A17

Links to Exploration step

Pascal:00-0325649

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Congruence closure modulo associativity and commutativity</title>
<author><name sortKey="Bachmair, L" sort="Bachmair, L" uniqKey="Bachmair L" first="L." last="Bachmair">L. Bachmair</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ramakrishnan, I V" sort="Ramakrishnan, I V" uniqKey="Ramakrishnan I" first="I. V." last="Ramakrishnan">I. V. Ramakrishnan</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Tiwari, A" sort="Tiwari, A" uniqKey="Tiwari A" first="A." last="Tiwari">A. Tiwari</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Vigneron, L" sort="Vigneron, L" uniqKey="Vigneron L" first="L." last="Vigneron">L. Vigneron</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA - Université Nancy 2 Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy </settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0325649</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 00-0325649 INIST</idno>
<idno type="RBID">Pascal:00-0325649</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A41</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000041</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000A17</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000A17</idno>
<idno type="wicri:doubleKey">0302-9743:2000:Bachmair L:congruence:closure:modulo</idno>
<idno type="wicri:Area/Main/Merge">00A623</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Congruence closure modulo associativity and commutativity</title>
<author><name sortKey="Bachmair, L" sort="Bachmair, L" uniqKey="Bachmair L" first="L." last="Bachmair">L. Bachmair</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ramakrishnan, I V" sort="Ramakrishnan, I V" uniqKey="Ramakrishnan I" first="I. V." last="Ramakrishnan">I. V. Ramakrishnan</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Tiwari, A" sort="Tiwari, A" uniqKey="Tiwari A" first="A." last="Tiwari">A. Tiwari</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Computer Science, State University of New York</s1>
<s2>Stony Brook, NY 11794-4400</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<wicri:noRegion>Stony Brook, NY 11794-4400</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Vigneron, L" sort="Vigneron, L" uniqKey="Vigneron L" first="L." last="Vigneron">L. Vigneron</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA - Université Nancy 2 Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy </s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-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="2000">2000</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>Decision rule</term>
<term>Logical programming</term>
<term>Program optimization</term>
<term>Rewriting systems</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Optimisation programme</term>
<term>Système réécriture</term>
<term>Règle décision</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We introduce the notion of an associative-commutative congruence closure and show how such closures can be constructed via completion-like transition rules. This method is based on combining completion algorithms for theories over disjoint signatures to produce a convergent rewrite system over an extended signature. This approach can also be used to solve the word problem for ground AC-theories without the need for AC-simplification orderings tptal on ground terms. Associative-commutative congruence closure provides a novel way to construct a convergent rewrite system for a ground AC-theory. This is done by transforming an AC-congruence closure, which is described by rewrite rules over an extended signature, to a rewrite system over the original signature. The set of rewrite rules thus obtained is convergent with respect to a new and simpler notion of associative-commutative reduction.</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>Vandœuvre-lès-Nancy </li>
</settlement>
</list>
<tree><country name="États-Unis"><noRegion><name sortKey="Bachmair, L" sort="Bachmair, L" uniqKey="Bachmair L" first="L." last="Bachmair">L. Bachmair</name>
</noRegion>
<name sortKey="Ramakrishnan, I V" sort="Ramakrishnan, I V" uniqKey="Ramakrishnan I" first="I. V." last="Ramakrishnan">I. V. Ramakrishnan</name>
<name sortKey="Tiwari, A" sort="Tiwari, A" uniqKey="Tiwari A" first="A." last="Tiwari">A. Tiwari</name>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Vigneron, L" sort="Vigneron, L" uniqKey="Vigneron L" first="L." last="Vigneron">L. Vigneron</name>
</region>
</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 00A623 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00A623 | 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:00-0325649
   |texte=   Congruence closure modulo associativity and commutativity
}}

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

Congruence closure modulo associativity and commutativity

Congruence closure modulo associativity and commutativity

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