{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:29:38Z","timestamp":1787340578033,"version":"build-2736575974"},"reference-count":27,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,11]]},"abstract":"<jats:p>The Knuth-Bendix completion procedure for term rewriting systems in many cases provides a decision procedure for equational theories and has been found to have many applications in various areas. We discuss the application of the Knuth-Bendix procedure to Thue systems. We use the notion of a reduced Thue system and show that for every Church-Rosser Thue system, there is a unique reduced Church-Rosser Thue system equivalent to it. Furthermore, the Knuth-Bendix completion procedure, when applied to a Thue system T, always produces the finite reduced Church-Rosser Thue system equivalent to T whenever such a system exists. Similar results can also be proved for almost-confluent Thue systems. Using properties of reduced Church-Rosser systems, we develop conditions under which a class of special Thue systems have equivalent finite Church-Rosser systems. In addition, we show that the completion procedure always terminates on finite parenthesized Thue systems, from which the termination of the completion procedure over ground-term-rewriting systems can be shown immediately. From the results discussed in this paper, we also obtain the termination of the Knuth-Bendix completion procedure for commutative Thue systems (commutative monoids) as a simple corollary.<\/jats:p>","DOI":"10.1137\/0214073","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"1052-1072","source":"Crossref","is-referenced-by-count":39,"title":["The Knuth-Bendix Completion Procedure and Thue Systems"],"prefix":"10.1137","volume":"14","author":[{"given":"Deepak","family":"Kapur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322301"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744568"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90177-8"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90078-5"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-3406-1_2"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90026-3"},{"key":"R7","unstructured":"N. Dershowitz,  Applications of the Knuth-Bendix Completion Procedure, Aerospace Report, ATR-83(8478)-2, Laboratory Operation, Aerospace Corporation,  1983, 15 May"},{"key":"R8","unstructured":"N. Dershowitz,  Existence and Construction of Rewrite Systems, Aerospace Report, ATR-82(8478)-3, Laboratory Operation, Aerospace Corporation,  1982, 1 December"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(69)90070-2"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90002-7"},{"key":"R12","unstructured":"A. Kandri-Rody, D. Kapur,  Computing the Grobner basis of a polynomial ideal over integers,  Third MACSYMA Users Conference, Schenectady, NY,  1984,  436\u2013451, (July)"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90008-8"},{"key":"R14","unstructured":"D. Kapur, P. Narendran,  Almost-Confluence and Related Properties of Thue Systems, Report, 83CRD258, General Electric Corporate Research and Development, Schenectady, NY,  1983, November"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90023-4"},{"key":"R16","unstructured":"D. Kapur, G. Sivakumar,  Experiments and architecture of RRL, a Rewrite Rule Laboratory,  Proceedings of an NSF Workshop on the Rewrite Rule Laboratory,  1983, (6-9 Sept.), General Electric Report 84GEN008, Schenectady, NY, April 1984, pp. 33\u201366"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"R18","unstructured":"D. S. Lankford, G. Butler,  Experiments with Computer Implementations of Procedures which Often Derive Decision Algorithms for the Word Problem in Abstract Algebra, Technical Report, MTP-7, Louisiana Tech. University,  1980, August"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"P. Lescanne,  Computer Experiments with the REVE Term Rewriting System Generator,  Proc. 10th ACM Symposium on Principles of Programming Languages,  1983,  99\u201368","DOI":"10.1145\/567067.567078"},{"key":"R20","unstructured":"E. Mayr, A. R. Meyer,  The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals, MIT-LCS-TM-199, Lab. for Computer Science, MIT, Cambridge,  1981, June"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90009-1"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.230459"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"D. R. Musser,  On proving inductive properties of abstract data types,  Proc. 7th ACM Symposium on Principles of Programming Languages,  1980,  154\u2013162","DOI":"10.1145\/567446.567461"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-11607-9_10"},{"key":"R25","unstructured":"P. Narendran, Masters Thesis,  Church-Rosser and related Thue systems, Ph.D. Dissertation, Dept. of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY,  1984"},{"key":"R26","first-page":"9","volume-title":"S\u00e9minaire P. Dubreil, 25e ann\u00e9e (1971\/72), Alg\u00e8bre, Fasc. 1, Exp. No. 7","author":"Nivat Maurice","year":"1973"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90039-7"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:40:14Z","timestamp":1787337614000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["10.1137\/0214073"],"URL":"https:\/\/doi.org\/10.1137\/0214073","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}