{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:50Z","timestamp":1760202470752},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6499,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1016\/0304-3975(95)00080-g","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"361-374","source":"Crossref","is-referenced-by-count":13,"title":["Modular termination of r-consistent and left-linear term rewriting systems"],"prefix":"10.1016","volume":"149","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Marchiori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven Eric","family":"Panitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00080-G_BIB1","series-title":"Proc 8th Conf. on Automated Deduction","first-page":"5","article-title":"Commutation, transformation and termination","volume":"Vol. 230","author":"Bachmair","year":"1986"},{"key":"10.1016\/0304-3975(95)00080-G_BIB2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","article-title":"Termination of rewriting","volume":"3","author":"Dershowitz","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(95)00080-G_BIB3","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(95)00080-G_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74769-4","article-title":"Termersetzungssysteme","author":"Drosten","year":"1989"},{"key":"10.1016\/0304-3975(95)00080-G_BIB5","series-title":"Proc. Internat. Conf. on Logic Programming and Automated Reasoning","first-page":"285","article-title":"Relating innermost, weak, uniform and modular termination of term rewriting systems","volume":"Vol. 624","author":"Gramlich","year":"1992"},{"key":"10.1016\/0304-3975(95)00080-G_BIB6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00080-G_BIB7","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. 2","author":"Klop","year":"1992"},{"key":"10.1016\/0304-3975(95)00080-G_BIB8","first-page":"357","article-title":"Modularity of simple termination in term rewriting systems","volume":"14","author":"Kurihara","year":"1991","journal-title":"J. Inform. Processing"},{"key":"10.1016\/0304-3975(95)00080-G_BIB9","article-title":"Modularity of UN\u2192 for left-linear term rewriting systems","author":"Marchiori","year":"1994"},{"key":"10.1016\/0304-3975(95)00080-G_BIB10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-59200-8_43","article-title":"Modularity of completeness revisited","author":"Marchiori","year":"1994"},{"key":"10.1016\/0304-3975(95)00080-G_BIB11","series-title":"Proc. 4th IEEE Symp. on Logic in Computer Science","first-page":"396","article-title":"A sufficient condition for the termination of the direct sum of term rewriting systems","author":"Middeldorp","year":"1989"},{"key":"10.1016\/0304-3975(95)00080-G_BIB12","article-title":"Modular properties of term rewriting systems","author":"Middeldorp","year":"1990"},{"key":"10.1016\/0304-3975(95)00080-G_BIB13","series-title":"Proc. 4th RTA-91","first-page":"188","article-title":"Completeness of combinations of constructor systems","volume":"Vol. 488","author":"Middeldorp","year":"1991"},{"key":"10.1016\/0304-3975(95)00080-G_BIB14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0020-0190(94)00187-4","article-title":"Termination is not modular for confluent variable-preserving term rewriting systems","volume":"53","author":"Ohlebusch","year":"1995","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(95)00080-G_BIB15","doi-asserted-by":"crossref","DOI":"10.1006\/jsco.1995.1036","article-title":"Modular properties of composable term rewriting systems","author":"Ohlebusch","year":"1994"},{"key":"10.1016\/0304-3975(95)00080-G_BIB16","article-title":"Termination characteristics of logic programs","author":"Rao","year":"1993"},{"key":"10.1016\/0304-3975(95)00080-G_BIB17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","article-title":"On termination of the direct sum of term rewriting systems","volume":"26","author":"Rusinowitch","year":"1987","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(95)00080-G_BIB18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","article-title":"Unification in a combination of arbitrary disjoint equational theories","volume":"8","author":"Schmidt-Schau\u00df","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(95)00080-G_BIB19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","article-title":"Counterexamples to the termination for the direct sum of term rewriting systems","volume":"25","author":"Toyama","year":"1987","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(95)00080-G_BIB20","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","article-title":"On the Church-Rosser property for the direct sum of term rewriting systems","volume":"34","author":"Toyama","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00080-G_BIB21","series-title":"Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications","first-page":"477","article-title":"Termination for the direct sum of left-linear term rewriting systems","volume":"Vol. 355","author":"Toyama","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500080G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500080G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T18:54:10Z","timestamp":1556304850000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500080G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["030439759500080G"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00080-g","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}