{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:13:03Z","timestamp":1768277583526,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7624,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["01460253"],"award-info":[{"award-number":["01460253"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["02249104"],"award-info":[{"award-number":["02249104"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0304-3975(92)90015-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"273-282","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":38,"title":["Modularity of simple termination of term rewriting systems with shared constructors"],"prefix":"10.1016","volume":"103","author":[{"given":"Masahito","family":"Kurihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azuma","family":"Ohuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90015-8_BIB1","first-page":"5","article-title":"Commutation, transformation, and termination","volume":"Vol. 230","author":"Bachmair","year":"1986"},{"key":"10.1016\/0304-3975(92)90015-8_BIB2","first-page":"448","article-title":"Termination of linear rewriting systems (Preliminary version)","volume":"Vol. 115","author":"Dershowitz","year":"1981"},{"key":"10.1016\/0304-3975(92)90015-8_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Orderings for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90015-8_BIB4","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(92)90015-8_BIB5","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(92)90015-8_BIB6","article-title":"Term rewriting systems","volume":"Vol. I","author":"Klop","year":"1991"},{"key":"10.1016\/0304-3975(92)90015-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(90)90221-I","article-title":"Modular term rewriting systems and the termination","volume":"34","author":"Kurihara","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90015-8_BIB8","first-page":"633","article-title":"Modularity of simple termination of term rewriting systems","volume":"31","author":"Kurihara","year":"1990","journal-title":"J. IPS Japan"},{"key":"10.1016\/0304-3975(92)90015-8_BIB9","series-title":"Proc. RTA '89","first-page":"263","article-title":"Modular aspects of properties of term rewriting systems related to normal forms","volume":"Vol. 355","author":"Middeldorp","year":"1989"},{"key":"10.1016\/0304-3975(92)90015-8_BIB10","first-page":"396","article-title":"A sufficient condition for the termination of the direct sum of term rewriting systems","author":"Middeldorp","year":"1989","journal-title":"Proc. 4th IEEE symp. Logic in Computer Science"},{"key":"10.1016\/0304-3975(92)90015-8_BIB11","first-page":"189","article-title":"Completeness of combinations of constructor systems","author":"Middeldorp","year":"1991","journal-title":"Proc. RTA '91"},{"key":"10.1016\/0304-3975(92)90015-8_BIB12","series-title":"Proc. CADE '86","first-page":"21","article-title":"Full-commutation and fair-termination in equational (and combined) term-rewriting systems","volume":"Vol. 230","author":"Porat","year":"1986"},{"key":"10.1016\/0304-3975(92)90015-8_BIB13","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. Process. Lett."},{"key":"10.1016\/0304-3975(92)90015-8_BIB14","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(92)90015-8_BIB15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","article-title":"Counterexamples to termination for the direct sum of term rewriting systems","volume":"25","author":"Toyama","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(92)90015-8_BIB16","series-title":"Proc. RTA '89","first-page":"477","article-title":"Termination for the direct sum of left-linear term rewriting systems (preliminary draft)","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:0304397592900158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592900158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:05Z","timestamp":1757477885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592900158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0304397592900158"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90015-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modularity of simple termination of term rewriting systems with shared constructors","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(92)90015-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}