{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:33Z","timestamp":1761611073036},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0020-0190(90)90221-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"1-4","source":"Crossref","is-referenced-by-count":13,"title":["Modular term rewriting systems and the termination"],"prefix":"10.1016","volume":"34","author":[{"given":"Masahito","family":"Kurihara","sequence":"first","affiliation":[]},{"given":"Ikuo","family":"Kaji","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90221-I_BIB1","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\/0020-0190(90)90221-I_BIB2","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"issue":"143","key":"10.1016\/0020-0190(90)90221-I_BIB3","first-page":"57","article-title":"Modular term rewriting systems: termination, confluence, and strategies","author":"Kurihara","year":"1988","journal-title":"IEICE Tech. Report COMP88"},{"issue":"9","key":"10.1016\/0020-0190(90)90221-I_BIB4","article-title":"Modularity of simple termination of term rewriting systems","author":"Kurihara","year":"1989","journal-title":"IPSJ SIG Report SF31"},{"key":"10.1016\/0020-0190(90)90221-I_BIB5","series-title":"Proc. 4th IEEE Symp. on Logic in Computer Science","article-title":"A sufficient condition for the termination of the direct sum of term rewriting systems","author":"Middeldorp","year":"1989"},{"key":"10.1016\/0020-0190(90)90221-I_BIB6","series-title":"Proc. 3rd Conf. on Rewriting Techniques and Applications","article-title":"Modular aspects of properties of term rewriting systems related to normal forms","volume":"355","author":"Middeldorp","year":"1989"},{"issue":"2","key":"10.1016\/0020-0190(90)90221-I_BIB7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","article-title":"Simplification by cooperating decision procedures","volume":"1","author":"Nelson","year":"1979","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/0020-0190(90)90221-I_BIB8","series-title":"Equational Logic as a Programming Language","author":"O'Donnell","year":"1985"},{"key":"10.1016\/0020-0190(90)90221-I_BIB9","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\/0020-0190(90)90221-I_BIB10","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. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(90)90221-I_BIB11","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\/0020-0190(90)90221-I_BIB12","series-title":"Proc. 3rd Conf. on Rewriting Techniques and Applications","article-title":"Termination for the direct sum of left-linear term rewriting systems","volume":"355","author":"Toyama","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090221I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090221I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:39Z","timestamp":1555088319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090221I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["002001909090221I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90221-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}