{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:57Z","timestamp":1725664797257},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:14Z","timestamp":1330292414000},"page":"230-244","source":"Crossref","is-referenced-by-count":0,"title":["Modularity of termination in term graph rewriting"],"prefix":"10.1007","author":[{"given":"M. R. K. Krishna","family":"Rao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"18_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.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"18_CR2","unstructured":"N. Dershowitz (1992), Hierarchical termination, draft, Hebrew University, Dec. 1992. Revised version in Proc. CTRS'94, LNCS 968, Springer-Verlag."},{"key":"18_CR3","first-page":"255","volume":"906","author":"M. Fernandez","year":"1995","unstructured":"M. Fernandez and J.P. Jouannaud (1995), Modular termination of term rewriting systems revisited, Proc. COMPASS workshop on ADT, LNCS 906, pp. 255\u2013273.","journal-title":"LNCS"},{"key":"18_CR4","doi-asserted-by":"publisher","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 5, pp. 131\u2013158.","journal-title":"AAECC"},{"key":"18_CR5","unstructured":"J.W. Klop (1992), Term Rewriting Systems, in S. Abramsky, D. Gabbay and T. Maibaum (ed.), Handbook of Logic in Computer Science, Vol. 2."},{"key":"18_CR6","first-page":"203","volume":"789","author":"M. K. Rao","year":"1994","unstructured":"M.R.K. Krishna Rao (1994), Simple termination of hierarchical combinations of term rewriting systems, Proc. of TACS'94, LNCS 789, pp. 203\u2013223.","journal-title":"LNCS"},{"key":"18_CR7","first-page":"379","volume":"915","author":"M. K. Rao","year":"1995","unstructured":"M.R.K. Krishna Rao (1995), Semi-completeness of hierarchical and superhierarchical combinations of term rewriting systems, Proc. of TAPSOFT'95, LNCS 915, pp. 379\u2013393.","journal-title":"LNCS"},{"key":"18_CR8","first-page":"371","volume":"969","author":"M. K. Rao","year":"1995","unstructured":"M.R.K. Krishna Rao (1995), Graph reducibility of term rewriting systems, Proc. of MFCS'95, LNCS 969, pp. 371\u2013381.","journal-title":"LNCS"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M. K. Rao","year":"1995","unstructured":"M.R.K. Krishna Rao (1995), Modular proofs for completeness of hierarchical term rewriting systems, Theoretical Computer Science\n151, pp. 487\u2013512.","journal-title":"Theoretical Computer Science"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(94)00248-3","volume":"152","author":"M. Kurihara","year":"1995","unstructured":"M. Kurihara and A. Ohuchi (1995), Modularity in noncopying term rewriting, Theoretical Computer Science\n152, pp. 139\u2013169.","journal-title":"Theoretical Computer Science"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1006\/jsco.1993.1024","volume":"15","author":"A. Middeldorp","year":"1993","unstructured":"A. Middeldorp and Y. Toyama (1993), Completeness of combinations of constructor systems, J. Symb. Comp.\n15, pp. 331\u2013348.","journal-title":"J. Symb. Comp."},{"key":"18_CR12","unstructured":"E. Ohlebusch (1994), Modular properties of composable term rewriting systems, Ph.D. Thesis, University of Bielefeld."},{"key":"18_CR13","first-page":"622","volume":"532","author":"D. Plump","year":"1990","unstructured":"D. Plump (1990), Graph-reducible term rewriting systems, Proc. 4th workshop on graph grammars and their applications to Computer Science, LNCS 532, pp. 622\u2013636.","journal-title":"LNCS"},{"key":"18_CR14","first-page":"97","volume":"656","author":"D. Plump","year":"1992","unstructured":"D. Plump (1992), Collapsed tree rewriting: completeness, confluence and modularity, Proc. CTRS'92, LNCS 656, pp. 97\u2013112.","journal-title":"LNCS"},{"key":"18_CR15","unstructured":"D. Plump (1993), Evaluation of functional expressions by hypergraph rewriting, Ph.D. Thesis, University of Bremen."},{"key":"18_CR16","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":"18_CR17","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"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:10Z","timestamp":1619573530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}