{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:36Z","timestamp":1725565416968},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_14","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"200-209","source":"Crossref","is-referenced-by-count":23,"title":["mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_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, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"14_CR2","unstructured":"Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany (2001)"},{"key":"14_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-45620-1_27","volume-title":"Automated Deduction - CADE-18","author":"C. Borralleras","year":"2002","unstructured":"Borralleras, C., Lucas, S., Rubio, A.: Recursive Path Orderings can be Context- Sensitive. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 314\u2013331. Springer, Heidelberg (2002)"},{"key":"14_CR4","unstructured":"Borralleras, C.: Ordering-based methods for proving termination automatically. PhD Thesis, Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya (May 2003)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-48685-2_24","volume-title":"Rewriting Techniques and Applications","author":"M.C.F. Ferreira","year":"1999","unstructured":"Ferreira, M.C.F., Ribeiro, A.L.: Context-sensitive AC-rewriting. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 286\u2013300. Springer, Heidelberg (1999)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/571157.571163","volume-title":"Proc. of PPDP 2002","author":"B. Gramlich","year":"2002","unstructured":"Gramlich, B., Lucas, S.: Modular termination of context-sensitive rewriting. In: Proc. of PPDP 2002, pp. 50\u201361. ACM Press, New York (2002)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/570186.570189","volume-title":"Proc. of RULE 2002","author":"B. Gramlich","year":"2002","unstructured":"Gramlich, B., Lucas, S.: Simple termination of context-sensitive rewriting. In: Proc. of RULE 2002, pp. 29\u201341. ACM Press, New York (2002)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-45005-X_20","volume-title":"Developments in Language Theory","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Middeldorp, A.: Termination of Innermost Context-Sensitive Rewriting. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 231\u2013244. Springer, Heidelberg (2003)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Giesl, J., Middeldorp, A.: Transformation Techniques for Context-Sensitive Rewrite Systems. In: Journal of Functional Programming (2004) (to appear)","DOI":"10.1017\/S0956796803004945"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-61440-0_122","volume-title":"Automata, Languages and Programming","author":"S. Lucas","year":"1996","unstructured":"Lucas, S.: Termination of context-sensitive rewriting by rewriting. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 122\u2013133. Springer, Heidelberg (1996)"},{"key":"14_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/3-540-45653-8_46","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Lucas","year":"2001","unstructured":"Lucas, S.: Termination of Rewriting With Strategy Annotations. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 669\u2013684. Springer, Heidelberg (2001)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Information and Computation\u00a0178(1), 293\u2013343 (2002)","journal-title":"Information and Computation"},{"key":"14_CR13","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Lazy Rewriting and Context-Sensitive Rewriting","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Lazy Rewriting and Context-Sensitive Rewriting. Electronic Notes in Theoretical Computer Science, vol.\u00a064. Elsevier Sciences, Amsterdam (2002)"},{"key":"14_CR14","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":"14_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(94)90032-9","volume":"49","author":"J. Steinbach","year":"1994","unstructured":"Steinbach, J.: Generating Polynomial Orderings. Information Processing Letters\u00a049, 85\u201393 (1994)","journal-title":"Information Processing Letters"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"1997","unstructured":"Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 172\u2013186. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T10:27:53Z","timestamp":1553077673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}