{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:22:09Z","timestamp":1725495729048},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643012"},{"type":"electronic","value":"9783540697213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0052375","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:31:11Z","timestamp":1149643871000},"page":"256-270","source":"Crossref","is-referenced-by-count":1,"title":["Termination transformation by tree lifting ordering"],"prefix":"10.1007","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshihito","family":"Toyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,18]]},"reference":[{"key":"20_CR1","unstructured":"T. Aoto and Y. Toyama. Tree lifting orderings for termination transformations of term rewriting systems. Research Report IS-RR-97-0033F, School of Information Science, JAIST, 1997."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"N. Dershowitz. Hierarchical termination. In Proceedings of the 4th International Workshop on Conditional (and Typed) Rewriting Systems (CTRS-94), LNCS 968, pages 89\u2013105. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60381-6_6"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez and J.-P. Jouannaud. Modular termination of term rewriting systems revisited. In Proceedings of the 10th Workshop on Specification of Abstract Data Types, LNCS 906, pages 255\u2013272. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0014432"},{"key":"20_CR4","unstructured":"M. C. F. Ferreira. Termination of term rewriting. PhD thesis, Utrecht University, 1995."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"M. C. F. Ferreira. Dummy elimination in equational rewriting. In Proceedings of the 1th International Conference on Rewriting Techniques and Applications (RTA-96), LNCS 1103, pages 78\u201392. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61464-8_44"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"M. C. F. Ferreira and H. Zantema. Dummy elimination: making termination easier. In Proceedings of the 10th International Conference on Foundamentals of Computation Theory (FCT'95), LNCS 965, pages 243\u2013252. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60249-6_56"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"M. C. F. Ferreira, D. Kesner and L. Puel. Reducing AC-termination to termination. Manuscript, 1997.","DOI":"10.1007\/BFb0055773"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/0304-3975(95)00075-8","volume":"151","author":"M. R. K. K. Rao","year":"1995","unstructured":"M. R. K. Krishna Rao. Modular proofs for completeness of hierarchical term rewriting systems. Theoretical Computer Science, 151:487\u2013512, 1995.","journal-title":"Theoretical Computer Science"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"A. Middeldorp. A sufficient condition for the termination of the direct sum of term rewriting systems. In Proceedings of the 4th annual IEEE Symposium on Logic in Computer Science (LICS'89), pages 396\u2013401. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39194"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"A. Middeldorp, H. Ohsaki and H. Zantema. Transforming termination by selflabelling. In Proceedings of the 13th International Conference on Automated Deduction (CADE-13), LNAI 1104, pages 373\u2013387. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61511-3_101"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0304-3975(96)00172-7","volume":"175","author":"A. Middeldorp","year":"1997","unstructured":"A. Middeldorp and H. Zantema. Simple termination of rewrite systems. Theoretical Computer Science, 175(1):127\u2013158, 1997.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:33:19Z","timestamp":1555641199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643012","9783540697213"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0052375","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}