{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:17Z","timestamp":1725566657855},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_3","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T20:20:02Z","timestamp":1285618802000},"page":"17-31","source":"Crossref","is-referenced-by-count":4,"title":["Orderings for Innermost Termination"],"prefix":"10.1007","author":[{"given":"Mirtha-Lina","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236(1-2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"3_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"3_CR3","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., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming\u00a09, 137\u2013160 (1987)","journal-title":"Science of Computer Programming"},{"key":"3_CR4","unstructured":"Borralleras, C.: Ordering-based methods for proving termination automatically. PhD thesis, Dpto. LSI, Universitat Polit\u00e8cnica de Catalunya, Espa\u00f1a (2003)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10721959_27","volume-title":"Automated Deduction - CADE-17","author":"C. Borralleras","year":"2000","unstructured":"Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, Springer, Heidelberg (2000)"},{"issue":"3","key":"3_CR6","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\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2004.10.005","volume":"93","author":"M.L. Fern\u00e1ndez","year":"2005","unstructured":"Fern\u00e1ndez, M.L.: Relaxing monotonicity for innermost termination. Information Processing Letters\u00a093(3), 117\u2013123 (2005)","journal-title":"Information Processing Letters"},{"key":"3_CR8","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: Induction for innermost and outermost ground termination. Technical Report A01-R-178, LORIA, Nancy, France (2001)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-39813-4_11","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Improving dependency pairs. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-61464-8_45","volume-title":"Rewriting Techniques and Applications","author":"B. Gramlich","year":"1996","unstructured":"Gramlich, B.: On proving termination by innermost termination. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 93\u2013107. Springer, Heidelberg (1996)"},{"key":"3_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-30210-0_16","volume-title":"Artificial Intelligence and Symbolic Computation","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Polynomial interpretations with negative coefficients. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol.\u00a03249, pp. 185\u2013198. Springer, Heidelberg (2004)"},{"key":"3_CR12","unstructured":"Kamin, S., Levy, J.J.: Two generalizations of the recursive path ordering. Dept. of Computer Science, Univ. of Illinois, Urbana, IL (1980)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K. Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 47\u201361. Springer, Heidelberg (1999)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. In: Proc. POPL, pp. 81\u201392 (2001)","DOI":"10.1145\/360204.360210"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-24727-2_23","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lucas","year":"2004","unstructured":"Lucas, S.: Polynomials for proving termination of context-sensitive rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 318\u2013332. Springer, Heidelberg (2004)"},{"key":"3_CR16","unstructured":"Manna, Z., Ness, S.: On the termination of Markov algorithms. In: Proc. Int. Conf. on System Science, pp. 789\u2013792 (1970)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08531-9","volume-title":"Computing in Systems Described by Equations","author":"M.J. O\u2019Donnell","year":"1977","unstructured":"O\u2019Donnell, M.J.: Computing in Systems Described by Equations. LNCS, vol.\u00a058. Springer, Heidelberg (1977)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Krishna Rao, M.R.K.: Some characteristic of strong innermost normalization. Theoretical Computer Science\u00a0(239), 141\u2013164 (2000)","DOI":"10.1016\/S0304-3975(99)00215-7"},{"key":"3_CR19","unstructured":"Steinbach, J., Xi, H.: Freezing - termination proofs for classical, context-sensitive and innermost rewriting. Technical report, Institut f\u00fcr Informatik, T.U. M\u00fcnchen, Germany (1998)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-44881-0_19","volume-title":"Rewriting Techniques and Applications","author":"R. Thiemann","year":"2003","unstructured":"Thiemann, R., Giesl, J.: Size-change termination for term rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 264\u2013278. Springer, Heidelberg (2003)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(87)90122-0","volume":"25","author":"Y. Toyama","year":"1987","unstructured":"Toyama, Y.: Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters\u00a025, 141\u2013143 (1987)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:45:35Z","timestamp":1619999135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}