Filters








489 Hits in 5.6 sec

The unification problem for one relation Thue Systems [chapter]

Christopher Lynch
<span title="">1998</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We give an algorithm for the unification problem for a generalization of Thue Systems with one relation. The word problem is a special case.  ...  Every word problem for Thue systems of one relation can be reduced to a simpler word problem which is either known to be solvable or has a different top symbol on the left and right side [3] .  ...  The Word and Unification Problem In this section we give a class of Thue systems which is a generalization of one equation Thue systems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055913">doi:10.1007/bfb0055913</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/254upbmbqneorjsdnt32pp6eda">fatcat:254upbmbqneorjsdnt32pp6eda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224214906/http://pdfs.semanticscholar.org/5bb9/0cd1b30c368178addd47ba37c9666e35f37c.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5b/b9/5bb90cd1b30c368178addd47ba37c9666e35f37c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055913"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 2227 of Mathematical Reviews Vol. , Issue 91D [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Many problems that are undecidable in general have been shown to be decidable for Church-Rosser Thue systems. For an overview see a paper of R. V. Book [J.  ...  From the summary: “In most cases of AC unification our method obviates the need for solving Diophantine equations, and thus avoids one of the bottlenecks of other associative-commutative unification techniques  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-04_91d/page/2227" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-04_91d/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 5376 of Mathematical Reviews Vol. , Issue 94i [page]

<span title="">1994</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
We also present the main ideas of an efficient E-unification algorithm based on presentations the conditions of which contain only E-unification problems between variables.”  ...  For ex- ample, presentations based on different kinds of conditions lead to E-unification algorithms the behavior of which depends on the axiom applied.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-09_94i/page/5376" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1994-09_94i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Editorial

Jean-Pierre Jouannaud
<span title="">1987</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ezljl2d3lzga5efenbxdvvfcpa" style="color: black;">Journal of symbolic computation</a> </i> &nbsp;
The paper by Ronald Book synthesises at least ten years of research on Thue Systems, with a particular emphasis on the role of Church-Rosser properties in deciding important questions related to Thue Systems  ...  Unfortunately, the paper leaves open the problem of unification for (left and right) distributivity.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0747-7171(87)80019-6">doi:10.1016/s0747-7171(87)80019-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4k7ir2vsinbfljsef4dyzxro4q">fatcat:4k7ir2vsinbfljsef4dyzxro4q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170924002839/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/0a6/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDc0NzcxNzE4NzgwMDE5Ng%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1b/9c/1b9c673f7e23b74564e91224928d7c11fd26801d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0747-7171(87)80019-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Early Completion Algorithm: Thue's 1914 Paper on the Transformation of Symbol Sequences [chapter]

James F. Power
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
References to Thue's 1914 paper on string transformation systems are based mainly on a small section of that work defining Thue systems.  ...  A closer study of the remaining parts of that paper highlight a number of important themes in the history of computing: the transition from algebra to formal language theory, the analysis of the "computational  ...  Of the many current models of computation, one of the oldest is the Thue system, first specified by Axel Thue 100 years ago [Thu14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08019-2_35">doi:10.1007/978-3-319-08019-2_35</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zji223d4y5f47dbct2jddl4ygm">fatcat:zji223d4y5f47dbct2jddl4ygm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161220034342/http://eprints.maynoothuniversity.ie/6372/1/JP-Early-Completion.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d2/ce/d2ce5072f6c9113d42e2d15758328acbd8d9d3b6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-08019-2_35"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Attributive description formalisms ... and the rest of the world [chapter]

Bernhard Nebel, Gert Smolka
<span title="">1991</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Although the intended applications for terminological logics and feature logics are not identical, and the computational services of systems based on the respective formalisms are quite different for this  ...  In this paper, we will show how attributive description formalisms relate to "the rest of the world."  ...  Acknowledgement We would like to thank Franz Baader and Werner Nutt for a number of helpful comments on an earlier version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-54594-8_74">doi:10.1007/3-540-54594-8_74</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/btaxsc3ftva5bbkah4ip34ba2i">fatcat:btaxsc3ftva5bbkah4ip34ba2i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070612220540/http://www.ps.uni-sb.de/Papers/abstracts/RR-91-15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fd/6d/fd6d733c79d2770be65e49b8309d40827b50a265.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-54594-8_74"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 5584 of Mathematical Reviews Vol. , Issue 96i [page]

<span title="">1996</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The author proves that the uniform termina- tion problem is undecidable for length-preserving finite semi-Thue systems having 9 rules.  ...  Existence of a semi-Thue system having 10 rules and with undecidable termination problem is shown. {For the entire collection see MR 96b:68005. } K. G.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-09_96i/page/5584" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1996-09_96i/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 4866 of Mathematical Reviews Vol. , Issue 2004f [page]

<span title="">2004</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
; Tsu) The unification problem for confluent right-ground term rewriting systems.  ...  Summary: “The unification problem for term rewriting systems (TRSs) is the problem of deciding, for a given TRS R and two terms M and N, whether there exists a substitution @ such that M@ and NO are congruent  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-06_2004f/page/4866" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2004-06_2004f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Report on 11th International Conference on Rewriting Techniques and Applications (RTA2000)
第11回 書き換え技法と応用国際会議 (RTA2000) 参加報告

Yoshihito Toyama
<span title="">2001</span> <i title="Japan Society for Software Science and Technology"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/rb7emmmksfcvpgy56dei5flkne" style="color: black;">Konpyuta sofutowea</a> </i> &nbsp;
Gutierrez, Normal forms and reduction for theories of binary relations • R. Statman, On the Word Problem for Combi- nators • M.  ...  Lohrey, Word Problems and Confluence Problems for Restricted Semi-Thue Systems 4 EXPSPACE • D. Miller, Abstarct Syntax for Variable Binders ) • J. Levy and M.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11309/jssst.18.306">doi:10.11309/jssst.18.306</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6eaopcvv3ndk7aanv7u76laz7y">fatcat:6eaopcvv3ndk7aanv7u76laz7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200324042922/https://www.jstage.jst.go.jp/article/jssst/18/2/18_2_306/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8b/3b/8b3b679cf957f1415e6263800797b89d90550904.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.11309/jssst.18.306"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A strict border for the decidability of E-unification for recursive functions [chapter]

Heinz Faßbender, Sebastian Maneth
<span title="">1996</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Acknowledgments We are thankful to Friedrich Otto for pointing out to us the possibility to improve our previous undecidability result by using the modified version of Post's correspondence problem.  ...  We also thank the referees for many helpful comments and suggestions.  ...  In Theorem 3.2 of [Ott86] , the undecidability of the uniform E-unification problem for finite, length-reducing, and confluent Thue systems is proved.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61735-3_13">doi:10.1007/3-540-61735-3_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wb25fpcfjzdktmfw6mrnvftgpy">fatcat:wb25fpcfjzdktmfw6mrnvftgpy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130627234021/http://scholar.lib.vt.edu/ejournals/JFLP/jflp/articles/1998/A98-04/JFLP-A98-04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/28/8f/288f2cd76e831d724b2d3a86a26cc5bd7ca52de9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-61735-3_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 1038 of Mathematical Reviews Vol. , Issue 94b [page]

<span title="">1994</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Book, A note on confluent Thue systems (231-236); C.  ...  Makanina, New systems of defining relations of the braid group (250-256). {Most of the papers are being reviewed individually.}  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1994-02_94b/page/1038" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1994-02_94b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 8086 of Mathematical Reviews Vol. , Issue 98M [page]

<span title="">1998</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Summary: “We give a polynomial algorithm solving the problem ‘is S partially confluent on the rational set R?’ for finite, basic, Noetherian semi-Thue systems.  ...  Since the word matching problem is the non-symmetric restriction of the word unification problem, this presents a non- trivial improvement of the recent result that for this type of string- rewriting system  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1998-12_98m/page/8086" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1998-12_98m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 6840 of Mathematical Reviews Vol. , Issue 91M [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
The author derives necessary and sufficient conditions for a Noetherian Thue system to be canonical over a set S.  ...  The pa- per extends theorems on pushout-complements known for several specific categories to elementary toposes. This generalization is based on a categorical approach to binary relations.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-12_91m/page/6840" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-12_91m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 420 of Mathematical Reviews Vol. , Issue 87a [page]

<span title="">1987</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
COMPUTER SCIENCE 420 Book, Thue systems as rewriting systems (pp. 63-94); Friedrich Otto, Deciding algebraic properties of monoids presented by finite Church- Rosser Thue systems (pp. 95-106); Stavros  ...  Fortenbacher, An algebraic approach to unification under associativity and commu- tativity (pp. 381-397); Stefan Arnborg and Erik Tidén, Unifica- tion problems with one-sided distributivity (pp. 398-406  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1987-01_87a/page/420" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1987-01_87a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Page 8181 of Mathematical Reviews Vol. , Issue 99m [page]

<span title="">1999</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
(1-CKSN-CS; Potsdam, NY) The unification problem for one relation Thue systems.  ...  Summary: “We give an algorithm for the unification problem for a generalization of Thue systems with one relation. The word problem is a special case.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1999-12_99m/page/8181" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1999-12_99m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 489 results