Normalization via Rewrite Closures
Identifieur interne : 002E39 ( Istex/Corpus ); précédent : 002E38; suivant : 002E40Normalization via Rewrite Closures
Auteurs : L. Bachmair ; C. R. Ramakrishnan ; I. V. Ramakrishnan ; A. TiwariSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.
Url:
DOI: 10.1007/3-540-48685-2_15
Links to Exploration step
ISTEX:C39A8270FDC14ECEE5AAEB4F233868E852FF7711Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Normalization via Rewrite Closures</title><author><name sortKey="Bachmair, L" sort="Bachmair, L" uniqKey="Bachmair L" first="L." last="Bachmair">L. Bachmair</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></affiliation></author><author><name sortKey="Ramakrishnan, C R" sort="Ramakrishnan, C R" uniqKey="Ramakrishnan C" first="C. R." last="Ramakrishnan">C. R. Ramakrishnan</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></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><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></affiliation></author><author><name sortKey="Tiwari, A" sort="Tiwari, A" uniqKey="Tiwari A" first="A." last="Tiwari">A. Tiwari</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C39A8270FDC14ECEE5AAEB4F233868E852FF7711</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1007/3-540-48685-2_15</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002E39</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002E39</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Normalization via Rewrite Closures</title><author><name sortKey="Bachmair, L" sort="Bachmair, L" uniqKey="Bachmair L" first="L." last="Bachmair">L. Bachmair</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></affiliation></author><author><name sortKey="Ramakrishnan, C R" sort="Ramakrishnan, C R" uniqKey="Ramakrishnan C" first="C. R." last="Ramakrishnan">C. R. Ramakrishnan</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></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><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></affiliation></author><author><name sortKey="Tiwari, A" sort="Tiwari, A" uniqKey="Tiwari A" first="A." last="Tiwari">A. Tiwari</name><affiliation><mods:affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</mods:affiliation></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="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>L. Bachmair</name><affiliations><json:string>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</json:string></affiliations></json:item><json:item><name>C. R. Ramakrishnan</name><affiliations><json:string>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</json:string></affiliations></json:item><json:item><name>I. V. Ramakrishnan</name><affiliations><json:string>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</json:string></affiliations></json:item><json:item><name>A. Tiwari</name><affiliations><json:string>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-ZHMPMJMJ-R</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.</abstract><qualityIndicators><score>7.78</score><pdfWordCount>6750</pdfWordCount><pdfCharCount>31927</pdfCharCount><pdfVersion>1.2</pdfVersion><pdfPageCount>15</pdfPageCount><pdfPageSize>431 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>65</abstractWordCount><abstractCharCount>443</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Normalization via Rewrite Closures</title><chapterId><json:string>15</json:string><json:string>Chap15</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>1999</copyrightDate><issn><json:string>0302-9743</json:string></issn><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor></serie><host><title>Rewriting Techniques and Applications</title><language><json:string>unknown</json:string></language><copyrightDate>1999</copyrightDate><doi><json:string>10.1007/3-540-48685-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-48685-5</json:string></eisbn><bookId><json:string>3-540-48685-2</json:string></bookId><isbn><json:string>978-3-540-66201-3</json:string></isbn><volume>1631</volume><pages><first>190</first><last>204</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Paliath Narendran</name><affiliations><json:string>Department of Computer Science, University at Albany — SUNY, 12222, Albany, NY, USA</json:string><json:string>E-mail: dran@cs.albany.edu</json:string></affiliations></json:item><json:item><name>Michael Rusinowitch</name><affiliations><json:string>LORIA — INRIA Lorraine 615, rue du Jardin Botanique, Villers les Nancy, F-54602, Cedex, France</json:string><json:string>E-mail: rusi@loria.fr</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Symbolic and Algebraic Manipulation</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-ZHMPMJMJ-R</json:string></ark><publicationDate>1999</publicationDate><copyrightDate>1999</copyrightDate><doi><json:string>10.1007/3-540-48685-2_15</json:string></doi><id>C39A8270FDC14ECEE5AAEB4F233868E852FF7711</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Normalization via Rewrite Closures</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="1999">1999</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Normalization via Rewrite Closures</title><author><persName><forename type="first">L.</forename><surname>Bachmair</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">SUNY at Stony Brook</orgName><address><street>Stony Brook</street><region>NY</region><postCode>11794</postCode><country key="US">UNITED STATES</country></address></affiliation></author><author><persName><forename type="first">C.</forename><forename type="first">R.</forename><surname>Ramakrishnan</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">SUNY at Stony Brook</orgName><address><street>Stony Brook</street><region>NY</region><postCode>11794</postCode><country key="US">UNITED STATES</country></address></affiliation></author><author><persName><forename type="first">I.</forename><forename type="first">V.</forename><surname>Ramakrishnan</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">SUNY at Stony Brook</orgName><address><street>Stony Brook</street><region>NY</region><postCode>11794</postCode><country key="US">UNITED STATES</country></address></affiliation></author><author><persName><forename type="first">A.</forename><surname>Tiwari</surname></persName><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">SUNY at Stony Brook</orgName><address><street>Stony Brook</street><region>NY</region><postCode>11794</postCode><country key="US">UNITED STATES</country></address></affiliation></author><idno type="istex">C39A8270FDC14ECEE5AAEB4F233868E852FF7711</idno><idno type="ark">ark:/67375/HCB-ZHMPMJMJ-R</idno><idno type="DOI">10.1007/3-540-48685-2_15</idno></analytic><monogr><title level="m" type="main">Rewriting Techniques and Applications</title><title level="m" type="sub">10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings</title><title level="m" type="part">Session 6:</title><idno type="DOI">10.1007/3-540-48685-2</idno><idno type="book-id">3-540-48685-2</idno><idno type="ISBN">978-3-540-66201-3</idno><idno type="eISBN">978-3-540-48685-5</idno><idno type="chapter-id">Chap15</idno><idno type="part-id">Part6</idno><editor><persName><forename type="first">Paliath</forename><surname>Narendran</surname></persName><email>dran@cs.albany.edu</email><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">University at Albany — SUNY</orgName><address><settlement>Albany</settlement><region>NY</region><postCode>12222</postCode><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Michael</forename><surname>Rusinowitch</surname></persName><email>rusi@loria.fr</email><affiliation><orgName type="institution">LORIA — INRIA Lorraine 615, rue du Jardin Botanique</orgName><address><postCode>F-54602</postCode><street>Villers les Nancy</street><settlement>Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><imprint><biblScope unit="vol">1631</biblScope><biblScope unit="page" from="190">190</biblScope><biblScope unit="page" to="204">204</biblScope><biblScope unit="chapter-count">30</biblScope><biblScope unit="part-chapter-count">3</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation><orgName type="institution">Karlsruhe University</orgName><address><country key="DE">GERMANY</country></address></affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation><orgName type="institution">Cornell University</orgName><address><region>NY</region><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName><affiliation><orgName type="institution">Utrecht University</orgName><address><country key=""></country></address></affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-1">Mathematical Logic and Formal Languages</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-2">Logics and Meanings of Programs</term></item><label>I14037</label><item><term type="Secondary" subtype="priority-3">Programming Languages, Compilers, Interpreters</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-4">Artificial Intelligence (incl. Robotics)</term></item><label>I17052</label><item><term type="Secondary" subtype="priority-5">Symbolic and Algebraic Manipulation</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-48685-2</BookID><BookTitle>Rewriting Techniques and Applications</BookTitle><BookSubTitle>10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings</BookSubTitle><BookVolumeNumber>1631</BookVolumeNumber><BookSequenceNumber>1631</BookSequenceNumber><BookDOI>10.1007/3-540-48685-2</BookDOI><BookTitleID>59621</BookTitleID><BookPrintISBN>978-3-540-66201-3</BookPrintISBN><BookElectronicISBN>978-3-540-48685-5</BookElectronicISBN><BookChapterCount>30</BookChapterCount><BookHistory><OnlineDate><Year>1999</Year><Month>11</Month><Day>5</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>1999</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16048" Priority="1" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I14037" Priority="3" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I21017" Priority="4" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I17052" Priority="5" Type="Secondary">Symbolic and Algebraic Manipulation</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Paliath</GivenName><FamilyName>Narendran</FamilyName></EditorName><Contact><Email>dran@cs.albany.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Michael</GivenName><FamilyName>Rusinowitch</FamilyName></EditorName><Contact><Email>rusi@loria.fr</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University at Albany — SUNY</OrgName><OrgAddress><City>Albany</City><State>NY</State><Postcode>12222</Postcode><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>LORIA — INRIA Lorraine 615, rue du Jardin Botanique</OrgName><OrgAddress><Postcode>F-54602</Postcode><Street>Villers les Nancy</Street><City>Cedex</City><Country>France</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part6"><PartInfo TocLevels="0"><PartID>6</PartID><PartSequenceNumber>6</PartSequenceNumber><PartTitle>Session 6:</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-48685-2</BookID><BookTitle>Rewriting Techniques and Applications</BookTitle></PartContext></PartInfo><Chapter ID="Chap15" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>15</ChapterID><ChapterDOI>10.1007/3-540-48685-2_15</ChapterDOI><ChapterSequenceNumber>15</ChapterSequenceNumber><ChapterTitle Language="En">Normalization via Rewrite Closures</ChapterTitle><ChapterFirstPage>190</ChapterFirstPage><ChapterLastPage>204</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>1999</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>1999</Year><Month>11</Month><Day>4</Day></RegistrationDate><OnlineDate><Year>1999</Year><Month>11</Month><Day>5</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>6</PartID><BookID>3-540-48685-2</BookID><BookTitle>Rewriting Techniques and Applications</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>L.</GivenName><FamilyName>Bachmair</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>C.</GivenName><GivenName>R.</GivenName><FamilyName>Ramakrishnan</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>I.</GivenName><GivenName>V.</GivenName><FamilyName>Ramakrishnan</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>A.</GivenName><FamilyName>Tiwari</FamilyName></AuthorName></Author><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>SUNY at Stony Brook</OrgName><OrgAddress><Street>Stony Brook</Street><State>NY</State><Postcode>11794</Postcode><Country>USA</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Normalization via Rewrite Closures</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Normalization via Rewrite Closures</title></titleInfo><name type="personal"><namePart type="given">L.</namePart><namePart type="family">Bachmair</namePart><affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="given">R.</namePart><namePart type="family">Ramakrishnan</namePart><affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">I.</namePart><namePart type="given">V.</namePart><namePart type="family">Ramakrishnan</namePart><affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">A.</namePart><namePart type="family">Tiwari</namePart><affiliation>Department of Computer Science, SUNY at Stony Brook, Stony Brook, 11794, NY, USA</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">1999</dateIssued><copyrightDate encoding="w3cdtf">1999</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: We present an abstract completion-based method for finding normal forms of terms with respect to given rewrite systems. The method uses the concept of a rewrite closure, which is a generalization of the idea of a congruence closure. Our results generalize previous results on congruence closure-based normalization methods. The description of known methods within our formalism also allows a better understanding of these procedures.</abstract><relatedItem type="host"><titleInfo><title>Rewriting Techniques and Applications</title><subTitle>10th International Conference, RTA-99 Trento, Italy, July 2–4, 1999 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Paliath</namePart><namePart type="family">Narendran</namePart><affiliation>Department of Computer Science, University at Albany — SUNY, 12222, Albany, NY, USA</affiliation><affiliation>E-mail: dran@cs.albany.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Michael</namePart><namePart type="family">Rusinowitch</namePart><affiliation>LORIA — INRIA Lorraine 615, rue du Jardin Botanique, Villers les Nancy, F-54602, Cedex, France</affiliation><affiliation>E-mail: rusi@loria.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1999</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I17052">Symbolic and Algebraic Manipulation</topic></subject><identifier type="DOI">10.1007/3-540-48685-2</identifier><identifier type="ISBN">978-3-540-66201-3</identifier><identifier type="eISBN">978-3-540-48685-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">59621</identifier><identifier type="BookID">3-540-48685-2</identifier><identifier type="BookChapterCount">30</identifier><identifier type="BookVolumeNumber">1631</identifier><identifier type="BookSequenceNumber">1631</identifier><identifier type="PartChapterCount">3</identifier><part><date>1999</date><detail type="part"><title>Session 6:</title></detail><detail type="volume"><number>1631</number><caption>vol.</caption></detail><extent unit="pages"><start>190</start><end>204</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">1999</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></relatedItem><identifier type="istex">C39A8270FDC14ECEE5AAEB4F233868E852FF7711</identifier><identifier type="ark">ark:/67375/HCB-ZHMPMJMJ-R</identifier><identifier type="DOI">10.1007/3-540-48685-2_15</identifier><identifier type="ChapterID">15</identifier><identifier type="ChapterID">Chap15</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 1999</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 1999</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-ZHMPMJMJ-R/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E39 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002E39 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:C39A8270FDC14ECEE5AAEB4F233868E852FF7711
|texte= Normalization via Rewrite Closures
}}
| This area was generated with Dilib version V0.6.33. |  |