{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:30Z","timestamp":1760202510385},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf01191381","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:00:46Z","timestamp":1108728046000},"page":"133-162","source":"Crossref","is-referenced-by-count":10,"title":["Total termination of term rewriting"],"prefix":"10.1007","volume":"7","author":[{"given":"M. C. F.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"H.","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"BF01191381_CR1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0167-6423(87)90030-X","volume":"9","author":"A. Ben-Cherifa","year":"1987","unstructured":"Ben-Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Sci Comput Programming9, 2, 137\u2013159 (1987)","journal-title":"Sci Comput Programming"},{"issue":"1","key":"BF01191381_CR2","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. J Symb Comput3, 1 and 2, 69\u2013116 (1987)","journal-title":"J Symb Comput"},{"key":"BF01191381_CR3","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of Theoretical Computer Science. van Leeuwen J (ed.), B. Elsevier, Chap. 6, pp. 243\u2013320 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"BF01191381_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications ACM22, 8, 465\u2013476 (1979)","journal-title":"Communications ACM"},{"key":"BF01191381_CR5","first-page":"213","volume-title":"vol. 690 of Lecture Notes in Computer Science","author":"M.C.F. Ferreira","year":"1993","unstructured":"Ferreira, M.C.F., 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 Lecture Notes in Computer Science. Springer Berlin, Heidelberg, New York: pp. 213\u2013227"},{"key":"BF01191381_CR6","first-page":"204","volume-title":"vol. 850, Lecture Notes in Computer Science","author":"M.C.F. Ferreira","year":"1994","unstructured":"Ferreira, M.C.F., Zantema, H.: Syntactical analysis of total termination. In: Proceedings of the 4th International Conference on Algebraic and Logic Programming (1994) Levi, G., Rodriguez Artalejo, M. (eds.), vol. 850, Lecture Notes in Computer Science. Berlin, Heidelberg, New York: Springer, pp. 204\u2013222. Appeared as report UU-CS-1994-28, Utrecht University"},{"key":"BF01191381_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira, M.C.F., 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"},{"issue":"1","key":"BF01191381_CR8","doi-asserted-by":"crossref","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. Theore Comput Sci105, 1, 129\u2013140 (1992)","journal-title":"Theore Comput Sci"},{"key":"BF01191381_CR9","unstructured":"Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA, 1978"},{"key":"BF01191381_CR10","unstructured":"Kamin, S., L\u00e9vy, J.J.: Two generalizations of the recursive path ordering. University of Illinois, 1980"},{"key":"BF01191381_CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1112\/blms\/14.4.285","volume":"14","author":"L. Kirby","year":"1982","unstructured":"Kirby, L., Paris, J.: Accessible independence results for Peano arithmetic. Bull London Math Soc14, 285\u2013293 (1982)","journal-title":"Bull London Math Soc"},{"key":"BF01191381_CR12","unstructured":"Kuratowski, K., Mostowski, A.: Set Theory. North-Holland Publishing Company, 1968"},{"issue":"5","key":"BF01191381_CR13","first-page":"633","volume":"31","author":"M. Kurihara","year":"1990","unstructured":"Kurihara, M., Ohuchi, A.: Modularity of simple termination of term rewriting systems. J IPS Jpn31, 5, 633\u2013642 (1990)","journal-title":"J IPS Jpn"},{"key":"BF01191381_CR14","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":"BF01191381_CR15","series-title":"vol. 632 Lecture Notes in Computer Sciences","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BFb0013817","volume-title":"Algebraic and Logic Programming","author":"P. Lescanne","year":"1992","unstructured":"Lescanne, P.: Termination of rewrite systems by elementary interpretations. In: Algebraic and Logic Programming (1992), Kirchner, H., Levi, G., (eds.), vol. 632 Lecture Notes in Computer Sciences. Berlin, Heidelberg, New York: Springer, pp. 21\u201336"},{"key":"BF01191381_CR16","doi-asserted-by":"crossref","unstructured":"Martin, U., 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)","DOI":"10.1109\/LICS.1993.287573"},{"key":"BF01191381_CR17","volume-title":"PhD thesis","author":"A. Middeldorp","year":"1990","unstructured":"Middeldorp, A.: Modular Properties of Term Rewriting Systems. PhD thesis, Free University Amsterdam, 1990"},{"key":"BF01191381_CR18","series-title":"Appeared as report RUU-CS-93-41","first-page":"451","volume-title":"vol. 814 Lecture Notes in Computer Science","author":"A. Middeldorp","year":"1994","unstructured":"Middeldorp, A., Zantema, H.: Simple termination revisited. In: Proceedings of the 12th International Conference on Automated Deduction (CADE12) (1994), Bundy, A., (ed.), vol. 814 Lecture Notes in Computer Science, Berlin, Heidelberg, New York: Springer, pp 451\u2013465. Appeared as report RUU-CS-93-41, Utrecht University"},{"key":"BF01191381_CR19","first-page":"433","volume-title":"vol. 355 Lecture Notes in Computer Science","author":"J. Steinbach","year":"1989","unstructured":"Steinbach, J.: Extensions and comparison of simplification orderings. In: Proceedings of the 3rd Conference on Rewriting Techniques an Applications (1989), Dershowitz, N. (ed.), vol. 355 Lecture Notes in Computer Science. Berlin, Heidelberg, New York: Springer pp 433\u2013448"},{"key":"BF01191381_CR20","series-title":"vol. 656 Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-56393-8_12","volume-title":"Conditional Term Rewriting Systems","author":"H. Zantema","year":"1993","unstructured":"Zantema, H.: Termination of term rewriting by interpretation. In: Conditional Term Rewriting Systems, Proceedings Third International Workshop CTRS-92 (1993), Rusinowitch, M. R\u00e9my, J., (eds.), vol. 656 Lecture Notes in Computer Science, Berlin, Heidelberg, New York: Springer, pp. 155\u2013167. Full version appeared as report RUU-CS-92-14, Utrecht University"},{"key":"BF01191381_CR21","doi-asserted-by":"crossref","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. J Symb Comput17, 23\u201350 (1994)","journal-title":"J Symb Comput"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191381.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191381\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:34Z","timestamp":1556629714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01191381"],"URL":"https:\/\/doi.org\/10.1007\/bf01191381","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}