{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:22Z","timestamp":1725664702548},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:19Z","timestamp":1330279039000},"page":"243-252","source":"Crossref","is-referenced-by-count":16,"title":["Dummy elimination: Making termination easier"],"prefix":"10.1007","author":[{"given":"M. C. F.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"H.","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01810293","volume":"1","author":"F. Bellegarde","year":"1990","unstructured":"Bellegarde, F., and Lescanne, P. Termination by completion. Applicable Algebra in Engineering, Communication and Computing 1, 2 (1990), 79\u201396.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N. Orderings for term rewriting systems. Theoretical Computer Science 17, 3 (1982), 279\u2013301.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N. Termination of rewriting. Journal of Symbolic Computation 3, 1 and 2 (1987), 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., and Jouannaud, J.-P. Rewrite systems. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. B. Elsevier, 1990, ch. 6, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., and Manna, Z. Proving termination with multiset orderings. Communications ACM 22, 8 (1979), 465\u2013476.","journal-title":"Communications ACM"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ferreira, M. C. F., Middeldorp, A., Ohsaki, H., and Zantema, H. Transforming termination by self-labelling. in preparation, 1995.","DOI":"10.1007\/3-540-61511-3_101"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira, M. C. F., and Zantema, H. Total termination of term rewriting. In Proceedings of the 5th Conference on Rewriting Techniques and Applications (1993), C. Kirchner, Ed., vol. 690 of LNCS, Springer, pp. 213\u2013227. Full version to appear in Applicable Algebra in Engineering, Communication and Computing.","DOI":"10.1007\/3-540-56868-9_17"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Ferreira, M. C. F., and Zantema, H. Well-foundedness of term orderings. To appear at CTRS 94 (Workshop on Conditional and Typed Term Rewriting Systems).","DOI":"10.1007\/3-540-60381-6_7"},{"key":"19_CR9","unstructured":"Kamin, S., and L\u00e9vy, J. J. Two generalizations of the recursive path ordering. University of Illinois, 1980."},{"key":"19_CR10","unstructured":"Zantema, H. Termination of term rewriting by semantic labelling. Tech. Rep. RUU-CS-92-38, Utrecht University, December 1992. Extended and revised version appeared as RUU-CS-93-24, July 1993, accepted for special issue on term rewriting of Fundamenta Informaticae."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/jsco.1994.1003","volume":"17","author":"H. Zantema","year":"1994","unstructured":"Zantema, H. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation 17 (1994), 23\u201350.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Zantema, H., and Geser, A. A complete characterization of termination of 0p1q \u2192 1r0s. In Proceedings of the 6th Conference on Rewriting Techniques and Applications (1995), J. Hsiang, Ed., vol. 914 of LNCS, Springer, pp. 41\u201355. Appeared as report UU-CS-1994-44, Utrecht University.","DOI":"10.1007\/3-540-59200-8_46"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:42Z","timestamp":1605646602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}