{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:48:45Z","timestamp":1767138525724,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540568681","type":"print"},{"value":"9783662215517","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/978-3-662-21551-7_17","type":"book-chapter","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T05:30:08Z","timestamp":1658208608000},"page":"213-227","source":"Crossref","is-referenced-by-count":6,"title":["Total termination of term rewriting"],"prefix":"10.1007","author":[{"given":"M. C. F.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"H.","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Ben-Cherifa","year":"1987","unstructured":"Ben-Cherifa, A., and Lescanne, P. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computing Programming 9, 2 (1987), 137\u2013159.","journal-title":"Science of Computing Programming"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","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":"17_CR3","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":"17_CR4","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"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(92)90289-R","volume":"105","author":"D. Hofbauer","year":"1992","unstructured":"Hofbauer, D. Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Theoretical Computer Science 105, 1 (1992), 129\u2013140.","journal-title":"Theoretical Computer Science"},{"key":"17_CR6","unstructured":"Huet, G., and Lankford, D. S. On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA, 1978."},{"key":"17_CR7","unstructured":"Kuratowski, K., and Mostowski, A. Set Theory. North-Holland Publishing Company, 1968."},{"issue":"5","key":"17_CR8","first-page":"633","volume":"31","author":"M. Kurihara","year":"1990","unstructured":"Kurihara, M., and Ohuchi, A. Modularity of simple termination of term rewriting systems. Journal of IPS Japan 31, 5 (1990), 633\u2013642.","journal-title":"Journal of IPS Japan"},{"key":"17_CR9","volume-title":"Tech. Rep. MTP-3","author":"D. S. Lankford","year":"1979","unstructured":"Lankford, D. S. On proving term rewriting systems are noetherian. Tech. Rep. MTP-3, Louisiana Technical University, Ruston, 1979."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Lescanne, P. Termination of rewrite systems by elementary interpretations. In Algebraic and Logic Programming (1992), H. Kirchner and G. Levi, Eds., vol. 632 of Lecture Notes in Computer Science, Springer, pp. 21\u201336.","DOI":"10.1007\/BFb0013817"},{"key":"17_CR11","unstructured":"Martin, U., and Scott, E. The order types of termination orderings on terms, strings and multisets. In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (1993)."},{"key":"17_CR12","volume-title":"PhD thesis","author":"A. Middeldorp","year":"1990","unstructured":"Middeldorp, A.\n                Modular Properties of Term Rewriting Systems. PhD thesis, Free University Amsterdam, 1990."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Steinbach, J. Extensions and comparison of simplification orderings. In Proceedings of the 3rd Conference on Rewriting Techniques an Applications (1989), N. Dershowitz, Ed., vol. 355 of Lecture Notes in Computer Science, Springer, pp. 434\u2013448.","DOI":"10.1007\/3-540-51081-8_124"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Zantema, H. Termination of term rewriting by interpretation. In Conditional Term Rewriting Systems, Proceedings Third International Workshop CTRS-92 (1993), M. Rusinowitch and J. R\u00e9my, Eds., vol. 656 of Lecture Notes in Computer Science, Springer, pp. 155\u2013167. Full version appeared as report RUU-CS-92-14, Utrecht University.","DOI":"10.1007\/3-540-56393-8_12"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-21551-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T05:30:57Z","timestamp":1658208657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-21551-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540568681","9783662215517"],"references-count":14,"aliases":["10.1007\/3-540-56868-9_17"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-21551-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}