{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:51Z","timestamp":1725664431503},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_208","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:10Z","timestamp":1330276330000},"page":"379-393","source":"Crossref","is-referenced-by-count":3,"title":["Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems"],"prefix":"10.1007","author":[{"given":"M. R. K. Krishna","family":"Rao","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320, North-Holland.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz (1995), Hierarchical termination, to appear in Proc. of CTRS'94, forthcoming LNCS, Springer-Verlag.","DOI":"10.1007\/3-540-60381-6_6"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"B. Gramlich (1992), Relating innermost, weak, uniform and modular termination of term rewrite systems, Proc. of Logic Prog. and Automated Reasoning, LPAR'92, Lecture Notes in Computer Science 624, pp. 285\u2013296, Springer-Verlag.","DOI":"10.1007\/BFb0013069"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01190827","volume":"5","author":"B. Gramlich","year":"1994","unstructured":"B. Gramlich (1994), Generalized sufficient conditions for modular termination of rewriting, in AAECC (Applicable Algebra in Engineering, Communication and Computing) 5, pp. 131\u2013158.","journal-title":"AAECC (Applicable Algebra in Engineering, Communication and Computing"},{"key":"25_CR5","unstructured":"J.W. Klop (1992), Term Rewriting Systems, tech rep. CS-R9073, CWI, Amsterdam. Also appears as a chapter in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2, Oxford University Press."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"M.R.K. Krishna Rao (1993), Completeness of hierarchical combinations of term rewriting systems, Proc. of 13th conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS'93, Lecture Notes in Computer Science 761, pp. 125\u2013138, Springer-Verlag.","DOI":"10.1007\/3-540-57529-4_48"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"M.R.K. Krishna Rao (1994), Simple termination of hierarchical combinations of term rewriting systems, Proc. of Theoretical Aspects of Computer Science, TACS'94, Lecture Notes in Computer Science 789, pp. 203\u2013223, Springer-Verlag.","DOI":"10.1007\/3-540-57887-0_97"},{"key":"25_CR8","volume-title":"Technical report","author":"M. K. Rao","year":"1994","unstructured":"M.R.K. Krishna Rao (1994), Semi-completeness of hierarchical and super hierarchical combinations of term rewriting systems, Technical report, TIFR, Bombay, October."},{"key":"25_CR9","first-page":"632","volume":"34","author":"M. Kurihara","year":"1990","unstructured":"M. Kurihara and A. Ohuchi (1990), Modularity of simple termination of term rewriting systems, Journal of IPS, Japan 34, pp. 632\u2013642.","journal-title":"Journal of IPS, Japan"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(92)90015-8","volume":"103","author":"M. Kurihara","year":"1992","unstructured":"M. Kurihara and A. Ohuchi (1992), Modularity of simple termination of term rewriting systems with shared constructors, Theoretical Computer Science 103, pp. 273\u2013282.","journal-title":"Theoretical Computer Science"},{"key":"25_CR11","unstructured":"A. Middeldorp (1989), A sufficient condition for the termination of the direct sum of terra rewriting systems, Proc. of LICS'89, pp. 396\u2013401."},{"key":"25_CR12","volume-title":"Ph.D. Thesis","author":"A. Middeldorp","year":"1990","unstructured":"A. Middeldorp (1990), Modular properties of term rewriting systems, Ph.D. Thesis, Free University, Amsterdam."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"A. Middeldorp and Y. Toyama (1991), Completeness of combinations of constructor systems, Proc. of RTA'91, Lecture Notes in Computer Science 488, pp. 188\u2013199, Springer-Verlag. Also appears in J. Symb. Comp. 15, pp. 331\u2013348.","DOI":"10.1007\/3-540-53904-2_96"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"E. Ohlebusch (1994), On the modularity of confluence of constructor-sharing term rewriting systems, Proc. of CAAP'94, Lecture Notes in Computer Science 787, pp.261\u2013275, Springer-Verlag.","DOI":"10.1007\/BFb0017487"},{"key":"25_CR15","unstructured":"D. Plump (1993), Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen."},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(87)90039-1","volume":"26","author":"M. Rusinowitch","year":"1987","unstructured":"M. Rusinowitch (1987), On termination of the direct sum of term rewriting systems, Information Processing Letters, IPL 26, pp. 65\u201370.","journal-title":"Information Processing Letters, IPL"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"J. Staples (1975), Church-Roser Theorems for Replacement Systems, in J. Crosley (ed.), Algebra and Logic, Lecture Notes in Mathematics, Vol 450, pp. 291\u2013307, Springer-Verlag.","DOI":"10.1007\/BFb0062861"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama (1987), On the Church-Rosser property for the direct sum of term rewriting systems, JACM 34, pp. 128\u2013143.","journal-title":"JACM"},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Y. Toyama (1987), Counterexamples to termination for the direct sum of term rewriting systems, Information Processing Letters, IPL 25, pp. 141\u2013143.","journal-title":"Information Processing Letters, IPL"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Y. Toyama, J.W. Klop and H.P. Barendrget (1989), Termination for the direct sum of left-linear term rewriting systems, Proc. of RTA'89, Lecture Notes in Computer Science 355, pp. 477\u2013491, Springer-Verlag.","DOI":"10.1007\/3-540-51081-8_127"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_208.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:33Z","timestamp":1605648393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_208","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}