{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:06Z","timestamp":1725664446915},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584315"},{"type":"electronic","value":"9783540487913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58431-5_15","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:06:09Z","timestamp":1330272369000},"page":"204-222","source":"Crossref","is-referenced-by-count":4,"title":["Syntactical analysis of total termination"],"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":"15_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., 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":"15_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. Journal of Symbolic Computation 3, 1 and 2 (1987), 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"15_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":"15_CR4","doi-asserted-by":"crossref","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":"15_CR5","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 Lecture Notes in Computer Science, Springer, pp. 213\u2013227. Full version submitted for publication.","DOI":"10.1007\/3-540-56868-9_17"},{"key":"15_CR6","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":"15_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0168-0072(91)90022-E","volume":"53","author":"J. H. Gallier","year":"1991","unstructured":"Gallier, J. H. What's so special about Kruskal's theorem and the ordinal \u03930? A survey of some results in proof theory. Annals of Pure and Applied Logic 53 (1991), 199\u2013260.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"15_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. Theoretical Computer Science 105, 1 (1992), 129\u2013140.","journal-title":"Theoretical Computer Science"},{"key":"15_CR9","unstructured":"Kamin, S., and L\u00e9vy, J. J. Two generalizations of the recursive path ordering. University of Illinois, 1980."},{"key":"15_CR10","unstructured":"Kuratowski, K., and Mostowski, A. Set Theory. North-Holland Publishing Company, 1968."},{"key":"15_CR11","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":"15_CR12","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":"15_CR13","doi-asserted-by":"crossref","unstructured":"Narendran, P., and Rusinowitch, M. Any ground associative-commutative theory has a finite canonical system. In Proceedings of the 4th Conference on Rewriting Techniques and Applications (1991), R. V. Book, Ed., vol. 488 of Lecture Notes in Computer Science, Springer, pp. 423\u2013434.","DOI":"10.1007\/3-540-53904-2_115"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C. S. J. J. A. A. Nash-Williams","year":"1963","unstructured":"Nash-Williams, C. S. J. A. On well-quasi ordering finite trees. Proc. Cambridge Phil. Soc. 59 (1963), 833\u2013835.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Rubio, A., and Nieuwenhuis, R. A precedence-based total AC-compatible ordering. In Proceedings of the 5th Conference on Rewriting Techniques and Applications (1993), C. Kirchner, Ed., vol. 690 of Lecture Notes in Computer Science, Springer, pp. 374\u2013388.","DOI":"10.1007\/3-540-56868-9_28"},{"key":"15_CR16","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":"15_CR17","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 to appear in Journal of Symbolic Computation.","DOI":"10.1007\/3-540-56393-8_12"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58431-5_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:15:47Z","timestamp":1619572547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58431-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584315","9783540487913"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58431-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}