Weakly Regular Relations and Applications
Identifieur interne : 000F91 ( Istex/Corpus ); précédent : 000F90; suivant : 000F92Weakly Regular Relations and Applications
Auteurs : Sébastien Limet ; Pierre Réty ; Helmut SeidlSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2001.
Abstract
Abstract: A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.
Url:
DOI: 10.1007/3-540-45127-7_15
Links to Exploration step
ISTEX:83AAA28C84F08A8EA74430C2B1B33724F6DD0C54Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Weakly Regular Relations and Applications</title>
<author><name sortKey="Limet, Sebastien" sort="Limet, Sebastien" uniqKey="Limet S" first="Sébastien" last="Limet">Sébastien Limet</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: limet@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: rety@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:83AAA28C84F08A8EA74430C2B1B33724F6DD0C54</idno>
<date when="2001" year="2001">2001</date>
<idno type="doi">10.1007/3-540-45127-7_15</idno>
<idno type="url">https://api.istex.fr/document/83AAA28C84F08A8EA74430C2B1B33724F6DD0C54/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000F91</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000F91</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Weakly Regular Relations and Applications</title>
<author><name sortKey="Limet, Sebastien" sort="Limet, Sebastien" uniqKey="Limet S" first="Sébastien" last="Limet">Sébastien Limet</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: limet@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Rety, Pierre" sort="Rety, Pierre" uniqKey="Rety P" first="Pierre" last="Réty">Pierre Réty</name>
<affiliation><mods:affiliation>LIFO, Université d’Orléans, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: rety@lifo.univ-orleans.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name>
<affiliation><mods:affiliation>Dept. of Computer Science, University of Trier, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: seidl@psi.uni-trier.de</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2001</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">83AAA28C84F08A8EA74430C2B1B33724F6DD0C54</idno>
<idno type="DOI">10.1007/3-540-45127-7_15</idno>
<idno type="ChapterID">15</idno>
<idno type="ChapterID">Chap15</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.</div>
</front>
</TEI>
<istex><corpusName>springer</corpusName>
<author><json:item><name>Sébastien Limet</name>
<affiliations><json:string>LIFO, Université d’Orléans, France</json:string>
<json:string>E-mail: limet@lifo.univ-orleans.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Pierre Réty</name>
<affiliations><json:string>LIFO, Université d’Orléans, France</json:string>
<json:string>E-mail: rety@lifo.univ-orleans.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Helmut Seidl</name>
<affiliations><json:string>Dept. of Computer Science, University of Trier, Germany</json:string>
<json:string>E-mail: seidl@psi.uni-trier.de</json:string>
</affiliations>
</json:item>
</author>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.</abstract>
<qualityIndicators><score>5.648</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>430 x 650 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>373</abstractCharCount>
<pdfWordCount>6988</pdfWordCount>
<pdfCharCount>31075</pdfCharCount>
<pdfPageCount>16</pdfPageCount>
<abstractWordCount>54</abstractWordCount>
</qualityIndicators>
<title>Weakly Regular Relations and Applications</title>
<chapterId><json:string>15</json:string>
<json:string>Chap15</json:string>
</chapterId>
<refBibs><json:item><author><json:item><name>A,C Caron</name>
</json:item>
<json:item><name>F Seynhaeve</name>
</json:item>
<json:item><name>S Tison</name>
</json:item>
<json:item><name>M Tommasi</name>
</json:item>
</author>
<host><author></author>
<title>Proceedings of 10th Conference RTA volume 1631 of LNCS</title>
<publicationDate>1999</publicationDate>
</host>
<title>Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting</title>
<publicationDate>1999</publicationDate>
</json:item>
<json:item><author><json:item><name>H Comon</name>
</json:item>
<json:item><name>M Dauchet</name>
</json:item>
<json:item><name>R Gilleron</name>
</json:item>
<json:item><name>D Lugiez</name>
</json:item>
<json:item><name>S Tison</name>
</json:item>
<json:item><name>M Tommasi</name>
</json:item>
</author>
<host><author></author>
<title>Tree Automata Techniques and Applications</title>
</host>
</json:item>
<json:item><author><json:item><name>L Fribourg</name>
</json:item>
</author>
<host><pages><last>185</last>
<first>172</first>
</pages>
<author></author>
<title>proceedings IEEE Symposium on Logic Programming</title>
<publicationDate>1985</publicationDate>
</host>
<title>SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting</title>
<publicationDate>1985</publicationDate>
</json:item>
<json:item><author><json:item><name>V Gouranton</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
<json:item><name>H Seidl</name>
</json:item>
</author>
<host><author></author>
<title>Proceedings of FoSSaCs, volume to appear of LNCS</title>
<publicationDate>2001</publicationDate>
</host>
<title>Synchronized Tree Languages Revisited and New Applications</title>
<publicationDate>2001</publicationDate>
</json:item>
<json:item><author><json:item><name>M Hermann</name>
</json:item>
<json:item><name>R Galbav´galbav´y</name>
</json:item>
</author>
<host><volume>176</volume>
<author></author>
<title>Theoretical Computer Science</title>
<publicationDate>1997</publicationDate>
</host>
<title>Unification of Infinite Sets of Terms Schematized by Primal Grammars</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><host><author><json:item><name>F Jacquemard</name>
</json:item>
</author>
<publicationDate>1996</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><pages><last>440</last>
<first>429</first>
</pages>
<author></author>
<title>Proceedings of 6th Colloquium on Trees in Algebra and Programming</title>
<publicationDate>1997</publicationDate>
</host>
<title>E-Unification by Means of Tree Tuple Synchronized Grammars Full version in</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
</author>
<host><author></author>
<title>A New Result about the Decidability of the Existential Onestep Rewriting Theory Proceedings of 10th Conference on Rewriting Techniques and Applications volume 1631 of LNCS</title>
<publicationDate>1999</publicationDate>
</host>
<publicationDate>1999</publicationDate>
</json:item>
<json:item><host><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>P Réty</name>
</json:item>
<json:item><name>H Seidl</name>
</json:item>
</author>
<title>Weakly Regular Relations and Applications</title>
<publicationDate>2000</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>F Saubion</name>
</json:item>
</author>
<host><pages><last>379</last>
<first>365</first>
</pages>
<author></author>
<title>proc of the 6th Conf. on Algebraic Methodology and Software Technology</title>
<publicationDate>1997</publicationDate>
</host>
<title>On partial validation of logic programs</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>S Limet</name>
</json:item>
<json:item><name>F Saubion</name>
</json:item>
</author>
<host><volume>1490</volume>
<pages><last>281</last>
<first>266</first>
</pages>
<author></author>
<title>LNCS</title>
<publicationDate>1998</publicationDate>
</host>
<title>A general framework for R-unification</title>
<publicationDate>1998</publicationDate>
</json:item>
<json:item><author><json:item><name>J Marcinkowski</name>
</json:item>
</author>
<host><pages><last>253</last>
<first>241</first>
</pages>
<author></author>
<title>Proceedings 8th Conference RTA</title>
<publicationDate>1997</publicationDate>
</host>
<title>Undecidability of the First-order Theory of One-step Right Ground Rewriting</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>J Niehren</name>
</json:item>
<json:item><name>M Pinkal</name>
</json:item>
<json:item><name>P Ruhrberg</name>
</json:item>
</author>
<host><pages><last>48</last>
<first>34</first>
</pages>
<author></author>
<title>Proc. of CADE'97</title>
<publicationDate>1997</publicationDate>
</host>
<title>On Equality up-to Constraints over Finite Trees ,Context Unification and One-step Rewriting</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>P Réty</name>
</json:item>
</author>
<host><author></author>
<title>Proceedings of the 6th international conference on Logic for Programming and Automated Reasoning (LPAR) Lecture Notes in Artificial Intelligence</title>
<publicationDate>1999</publicationDate>
</host>
<title>Regular Sets of Descendants for Constructor-based Rewrite Systems</title>
<publicationDate>1999</publicationDate>
</json:item>
<json:item><author><json:item><name>F Seynhaeve</name>
</json:item>
<json:item><name>M Tommasi</name>
</json:item>
<json:item><name>R Treinen</name>
</json:item>
</author>
<host><pages><last>368</last>
<first>357</first>
</pages>
<author></author>
<title>Proceedings of 6th Colloquium on Trees in Algebra and Programming</title>
<publicationDate>1997</publicationDate>
</host>
<title>Grid Structures and Undecidable Constraint Theories</title>
<publicationDate>1997</publicationDate>
</json:item>
<json:item><author><json:item><name>R Treinen</name>
</json:item>
</author>
<host><volume>208</volume>
<pages><last>190</last>
<first>179</first>
</pages>
<author></author>
<title>Theoretical Computer Science</title>
<publicationDate>1998</publicationDate>
</host>
<title>The First-order Theory of One-step Rewriting is Undecidable</title>
<publicationDate>1998</publicationDate>
</json:item>
<json:item><author><json:item><name>S Vorobyov</name>
</json:item>
</author>
<host><pages><last>253</last>
<first>241</first>
</pages>
<author></author>
<title>Proceedings 8th Conference RTA</title>
<publicationDate>1997</publicationDate>
</host>
<title>The First-order Theory of One-step Rewriting in Linear Noetherian Systems is Undecidable</title>
<publicationDate>1997</publicationDate>
</json:item>
</refBibs>
<genre><json:string>conference</json:string>
</genre>
<serie><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>
<issn><json:string>0302-9743</json:string>
</issn>
<language><json:string>unknown</json:string>
</language>
<title>Lecture Notes in Computer Science</title>
<copyrightDate>2001</copyrightDate>
</serie>
<host><editor><json:item><name>Aart Middeldorp</name>
<affiliations><json:string>Institute of Information Sciences and Electronics, University of Tsukuba, 305-8573, Tsukuba, Japan</json:string>
<json:string>E-mail: ami@is.tsukuba.ac.jp</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>
<isbn><json:string>978-3-540-42117-7</json:string>
</isbn>
<language><json:string>unknown</json:string>
</language>
<title>Rewriting Techniques and Applications</title>
<bookId><json:string>3-540-45127-7</json:string>
</bookId>
<volume>2051</volume>
<pages><last>200</last>
<first>185</first>
</pages>
<issn><json:string>0302-9743</json:string>
</issn>
<genre><json:string>book-series</json:string>
</genre>
<eisbn><json:string>978-3-540-45127-3</json:string>
</eisbn>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45127-7</json:string>
</doi>
</host>
<publicationDate>2001</publicationDate>
<copyrightDate>2001</copyrightDate>
<doi><json:string>10.1007/3-540-45127-7_15</json:string>
</doi>
<id>83AAA28C84F08A8EA74430C2B1B33724F6DD0C54</id>
<score>0.60580945</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/83AAA28C84F08A8EA74430C2B1B33724F6DD0C54/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/83AAA28C84F08A8EA74430C2B1B33724F6DD0C54/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/83AAA28C84F08A8EA74430C2B1B33724F6DD0C54/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Weakly Regular Relations and Applications</title>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
<respStmt><resp>Références bibliographiques récupérées via GROBID</resp>
<name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name>
</respStmt>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<availability><p>Springer-Verlag Berlin Heidelberg, 2001</p>
</availability>
<date>2001</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Weakly Regular Relations and Applications</title>
<author xml:id="author-1"><persName><forename type="first">Sébastien</forename>
<surname>Limet</surname>
</persName>
<email>limet@lifo.univ-orleans.fr</email>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
</author>
<author xml:id="author-2"><persName><forename type="first">Pierre</forename>
<surname>Réty</surname>
</persName>
<email>rety@lifo.univ-orleans.fr</email>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
</author>
<author xml:id="author-3"><persName><forename type="first">Helmut</forename>
<surname>Seidl</surname>
</persName>
<email>seidl@psi.uni-trier.de</email>
<affiliation>Dept. of Computer Science, University of Trier, Germany</affiliation>
</author>
</analytic>
<monogr><title level="m">Rewriting Techniques and Applications</title>
<title level="m" type="sub">12th International Conference, RTA 2001 Utrecht, The Netherlands, May 22–24, 2001 Proceedings</title>
<idno type="pISBN">978-3-540-42117-7</idno>
<idno type="eISBN">978-3-540-45127-3</idno>
<idno type="pISSN">0302-9743</idno>
<idno type="DOI">10.1007/3-540-45127-7</idno>
<idno type="book-ID">3-540-45127-7</idno>
<idno type="book-title-ID">66925</idno>
<idno type="book-sequence-number">2051</idno>
<idno type="book-volume-number">2051</idno>
<idno type="book-chapter-count">27</idno>
<editor><persName><forename type="first">Aart</forename>
<surname>Middeldorp</surname>
</persName>
<email>ami@is.tsukuba.ac.jp</email>
<affiliation>Institute of Information Sciences and Electronics, University of Tsukuba, 305-8573, Tsukuba, Japan</affiliation>
</editor>
<imprint><publisher>Springer Berlin Heidelberg</publisher>
<pubPlace>Berlin, Heidelberg</pubPlace>
<date type="published" when="2001-05-08"></date>
<biblScope unit="volume">2051</biblScope>
<biblScope unit="page" from="185">185</biblScope>
<biblScope unit="page" to="200">200</biblScope>
</imprint>
</monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Goos</surname>
</persName>
<affiliation>Karlsruhe University, Germany</affiliation>
</editor>
<editor><persName><forename type="first">Juris</forename>
<surname>Hartmanis</surname>
</persName>
<affiliation>Cornell University, NY, USA</affiliation>
</editor>
<editor><persName><forename type="first">Jan</forename>
<surname>van Leeuwen</surname>
</persName>
<affiliation>Utrecht University, The Netherlands</affiliation>
</editor>
<biblScope><date>2001</date>
</biblScope>
<idno type="pISSN">0302-9743</idno>
<idno type="series-Id">558</idno>
</series>
<idno type="istex">83AAA28C84F08A8EA74430C2B1B33724F6DD0C54</idno>
<idno type="DOI">10.1007/3-540-45127-7_15</idno>
<idno type="ChapterID">15</idno>
<idno type="ChapterID">Chap15</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>2001</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.</p>
</abstract>
<textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass><keywords scheme="Book-Subject-Group"><list><label>I</label>
<label>I16048</label>
<label>I1603X</label>
<label>I14037</label>
<label>I21017</label>
<label>I17052</label>
<item><term>Computer Science</term>
</item>
<item><term>Mathematical Logic and Formal Languages</term>
</item>
<item><term>Logics and Meanings of Programs</term>
</item>
<item><term>Programming Languages, Compilers, Interpreters</term>
</item>
<item><term>Artificial Intelligence (incl. Robotics)</term>
</item>
<item><term>Symbolic and Algebraic Manipulation</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="2001-05-08">Published</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-23">References added</change>
<change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change>
</revisionDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/document/83AAA28C84F08A8EA74430C2B1B33724F6DD0C54/fulltext/txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="Springer, Publisher 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" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45127-7</BookID>
<BookTitle>Rewriting Techniques and Applications</BookTitle>
<BookSubTitle>12th International Conference, RTA 2001 Utrecht, The Netherlands, May 22–24, 2001 Proceedings</BookSubTitle>
<BookVolumeNumber>2051</BookVolumeNumber>
<BookSequenceNumber>2051</BookSequenceNumber>
<BookDOI>10.1007/3-540-45127-7</BookDOI>
<BookTitleID>66925</BookTitleID>
<BookPrintISBN>978-3-540-42117-7</BookPrintISBN>
<BookElectronicISBN>978-3-540-45127-3</BookElectronicISBN>
<BookChapterCount>27</BookChapterCount>
<BookHistory><OnlineDate><Year>2001</Year>
<Month>5</Month>
<Day>8</Day>
</OnlineDate>
</BookHistory>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</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>Aart</GivenName>
<FamilyName>Middeldorp</FamilyName>
</EditorName>
<Contact><Email>ami@is.tsukuba.ac.jp</Email>
</Contact>
</Editor>
<Affiliation ID="Aff4"><OrgDivision>Institute of Information Sciences and Electronics</OrgDivision>
<OrgName>University of Tsukuba</OrgName>
<OrgAddress><City>Tsukuba</City>
<Postcode>305-8573</Postcode>
<Country>Japan</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Regular Papers</PartTitle>
<PartChapterCount>25</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookID>3-540-45127-7</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-45127-7_15</ChapterDOI>
<ChapterSequenceNumber>15</ChapterSequenceNumber>
<ChapterTitle Language="En">Weakly Regular Relations and Applications</ChapterTitle>
<ChapterFirstPage>185</ChapterFirstPage>
<ChapterLastPage>200</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2001</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><RegistrationDate><Year>2001</Year>
<Month>5</Month>
<Day>7</Day>
</RegistrationDate>
<OnlineDate><Year>2001</Year>
<Month>5</Month>
<Day>8</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>2</PartID>
<BookID>3-540-45127-7</BookID>
<BookTitle>Rewriting Techniques and Applications</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Sébastien</GivenName>
<FamilyName>Limet</FamilyName>
</AuthorName>
<Contact><Email>limet@lifo.univ-orleans.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff5"><AuthorName DisplayOrder="Western"><GivenName>Pierre</GivenName>
<FamilyName>Réty</FamilyName>
</AuthorName>
<Contact><Email>rety@lifo.univ-orleans.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Helmut</GivenName>
<FamilyName>Seidl</FamilyName>
</AuthorName>
<Contact><Email>seidl@psi.uni-trier.de</Email>
</Contact>
</Author>
<Affiliation ID="Aff5"><OrgDivision>LIFO</OrgDivision>
<OrgName>Université d’Orléans</OrgName>
<OrgAddress><Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff6"><OrgDivision>Dept. of Computer Science</OrgDivision>
<OrgName>University of Trier</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.</Para>
</Abstract>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Weakly Regular Relations and Applications</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Weakly Regular Relations and Applications</title>
</titleInfo>
<name type="personal"><namePart type="given">Sébastien</namePart>
<namePart type="family">Limet</namePart>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
<affiliation>E-mail: limet@lifo.univ-orleans.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Pierre</namePart>
<namePart type="family">Réty</namePart>
<affiliation>LIFO, Université d’Orléans, France</affiliation>
<affiliation>E-mail: rety@lifo.univ-orleans.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Helmut</namePart>
<namePart type="family">Seidl</namePart>
<affiliation>Dept. of Computer Science, University of Trier, Germany</affiliation>
<affiliation>E-mail: seidl@psi.uni-trier.de</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre type="conference" displayLabel="OriginalPaper"></genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2001-05-08</dateIssued>
<copyrightDate encoding="w3cdtf">2001</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<physicalDescription><internetMediaType>text/html</internetMediaType>
</physicalDescription>
<abstract lang="en">Abstract: A new class of tree-tuple languages is introduced: the weakly regular relations. It is an extension of the regular case (regular relations) and a restriction of tree-tuple synchronized languages, that has all usual nice properties, except closure under complement. Two applications are presented: to unification modulo a rewrite system, and to one-step rewriting.</abstract>
<relatedItem type="host"><titleInfo><title>Rewriting Techniques and Applications</title>
<subTitle>12th International Conference, RTA 2001 Utrecht, The Netherlands, May 22–24, 2001 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Aart</namePart>
<namePart type="family">Middeldorp</namePart>
<affiliation>Institute of Information Sciences and Electronics, University of Tsukuba, 305-8573, Tsukuba, Japan</affiliation>
<affiliation>E-mail: ami@is.tsukuba.ac.jp</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" displayLabel="Proceedings"></genre>
<originInfo><copyrightDate encoding="w3cdtf">2001</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-45127-7</identifier>
<identifier type="ISBN">978-3-540-42117-7</identifier>
<identifier type="eISBN">978-3-540-45127-3</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="BookTitleID">66925</identifier>
<identifier type="BookID">3-540-45127-7</identifier>
<identifier type="BookChapterCount">27</identifier>
<identifier type="BookVolumeNumber">2051</identifier>
<identifier type="BookSequenceNumber">2051</identifier>
<identifier type="PartChapterCount">25</identifier>
<part><date>2001</date>
<detail type="part"><title>Regular Papers</title>
</detail>
<detail type="volume"><number>2051</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>185</start>
<end>200</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</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><copyrightDate encoding="w3cdtf">2001</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">83AAA28C84F08A8EA74430C2B1B33724F6DD0C54</identifier>
<identifier type="DOI">10.1007/3-540-45127-7_15</identifier>
<identifier type="ChapterID">15</identifier>
<identifier type="ChapterID">Chap15</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2001</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2001</recordOrigin>
</recordInfo>
</mods>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F91 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000F91 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:83AAA28C84F08A8EA74430C2B1B33724F6DD0C54 |texte= Weakly Regular Relations and Applications }}
This area was generated with Dilib version V0.6.31. |