{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:57Z","timestamp":1725489357929},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73449-9_30","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:49:53Z","timestamp":1187009393000},"page":"404-418","source":"Crossref","is-referenced-by-count":6,"title":["Termination by Quasi-periodic Interpretations"],"prefix":"10.1007","author":[{"given":"Hans","family":"Zantema","sequence":"first","affiliation":[]},{"given":"Johannes","family":"Waldmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_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":"30_CR2","unstructured":"Termination Problems\u00a0Data Base, http:\/\/www.lri.fr\/~marche\/tpdb\/"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005), http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat\/"},{"key":"30_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/11814771_47","volume-title":"Automated Reasoning","author":"J. Endrullis","year":"2006","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 574\u2013588. Springer, Heidelberg (2006)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44881-0_29","volume-title":"Rewriting Techniques and Applications","author":"A. Geser","year":"2003","unstructured":"Geser, A.: Termination of string rewriting rules that have one pair of overlaps. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 410\u2013423. Springer, Heidelberg (2003)"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0129054105003108","volume":"16","author":"A. Geser","year":"2005","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Finding finite automata that certify termination of string rewriting. International Journal of Foundations of Computer Science\u00a016(3), 471\u2013486 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation\u00a034(1), 21\u201358 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11805618_25","volume-title":"Term Rewriting and Applications","author":"D. Hofbauer","year":"2006","unstructured":"Hofbauer, D., Waldmann, J.: Proving termination with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 328\u2013342. Springer, Heidelberg (2006)"},{"key":"30_CR9","volume-title":"Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA)","author":"C. March\u00e9","year":"2007","unstructured":"March\u00e9, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA), Springer, Heidelberg (2007), http:\/\/www.lri.fr\/~marche\/termination-competition\/"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-540-32033-3_25","volume-title":"Term Rewriting and Applications","author":"W. Moczyd\u0142owski","year":"2005","unstructured":"Moczyd\u0142owski, W., Geser, A.: Termination of single-threaded one-rule Semi-Thue systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 338\u2013352. Springer, Heidelberg (2005)"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","volume":"24","author":"H. Zantema","year":"1995","unstructured":"Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae\u00a024, 89\u2013105 (1995)","journal-title":"Fundamenta Informaticae"},{"key":"30_CR12","first-page":"181","volume-title":"Term Rewriting Systems, by Terese","author":"H. Zantema","year":"2003","unstructured":"Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181\u2013259. Cambridge University Press, Cambridge (2003)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10817-005-6545-0","volume":"34","author":"H. Zantema","year":"2004","unstructured":"Zantema, H.: Termination of string rewriting proved automatically. Journal of Automated Reasoning\u00a034, 105\u2013139 (2004)","journal-title":"Journal of Automated Reasoning"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-59200-8_46","volume-title":"Rewriting Techniques and Applications","author":"H. Zantema","year":"1995","unstructured":"Zantema, H., Geser, A.: A complete characterization of termination of 0 p 1 q \u21921 r 0 s . In: Hsiang, J. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a0914, pp. 41\u201355. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T16:52:36Z","timestamp":1587833556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734475","9783540734499"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}