{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T19:00:38Z","timestamp":1751569238447},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_23","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T12:49:53Z","timestamp":1187009393000},"page":"303-313","source":"Crossref","is-referenced-by-count":20,"title":["The Termination Competition"],"prefix":"10.1007","author":[{"given":"Claude","family":"March\u00e9","sequence":"first","affiliation":[]},{"given":"Hans","family":"Zantema","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Manna, Z., Ness, S.: On the termination of Markov algorithms. In: ICSS. pp. 789\u2013792 (1970), http:\/\/perso.ens-lyon.fr\/pierre.lescanne\/not_accessible.html"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Lescanne, P.: Computer experiments with the REVE term rewriting system generator. In: Proc. POPL 1983 (1983)","DOI":"10.1145\/567067.567078"},{"key":"23_CR3","unstructured":"Forgaard, R., Detlefs, D.: Reve 2.4: A program for generating and analyzing term rewriting systems. Massachusetts Institute (1984)"},{"key":"23_CR4","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":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Spring School of Theoretical Computer Science","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 examples of termination. In: Comon, H., Jouannaud, J.-P. (eds.) Spring School of Theoretical Computer Science. LNCS, vol.\u00a0909, pp. 16\u201326. Springer, Heidelberg (1995)"},{"key":"23_CR6","unstructured":"Steinbach, J., K\u00fchler, U.: Check your ordering \u2013 termination proofs and open problems. Technical Report SEKI Report SR-90-25, Univ. Kaiserslautern (1990)"},{"key":"23_CR7","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":"23_CR8","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: The AProVE tool (RWTH, Aachen, Germany), http:\/\/aprove.informatik.rwth-aachen.de\/"},{"key":"23_CR9","unstructured":"Fissore, O., Gnaedig, I., Kirchner, H.: CARIBOO: A multi-strategy termination proof tool based on induction. In: Rubio, A. (ed.) WST, pp. 77\u201379 (2003)"},{"key":"23_CR10","unstructured":"Contejean, E., March\u00e9, C., Urbain, X.: The CiME rewrite toolbox (LRI, Orsay, France), http:\/\/cime.lri.fr"},{"key":"23_CR11","unstructured":"Waldmann, J.: The MatchBox tool (HTWK, Leipzig, Germany), http:\/\/dfa.imn.htwk-leipzig.de\/matchbox\/"},{"key":"23_CR12","unstructured":"Borralleras, C., Rubio, A.: The termptation tool (Universitat Politecnica de Catalunya, Spain), http:\/\/www.lsi.upc.es\/~albert\/term.html"},{"key":"23_CR13","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool (Innsbruck Universit\u00e4t, Austria), http:\/\/colo6-c703.uibk.ac.at\/ttt\/"},{"key":"23_CR14","unstructured":"Claves, C., Ohlebusch, E.: The TALP tool (University of Bielefeld, Germany), http:\/\/bibiserv.techfak.uni-bielefeld.de\/talp\/"},{"key":"23_CR15","unstructured":"Codish, M., Taboch, C.: the TerminWeb tool (Ben Gurion University, Israel), http:\/\/www.cs.bgu.ac.il\/~mcodish\/TerminWeb\/"},{"key":"23_CR16","unstructured":"Serebrenik, A., De\u00a0Schreye, D.: The Hasta-La-Vista tool (K.U. Leuven, Belgium)"},{"key":"23_CR17","unstructured":"Zantema, H.: The TORPA tool (Technische Universteit Eindhoven, The Netherlands), http:\/\/www.win.tue.nl\/~hzantema\/torpa.html"},{"key":"23_CR18","unstructured":"Koprowski, A.: The TPA tool (Technische Universteit Eindhoven, The Netherlands), http:\/\/www.win.tue.nl\/tpa"},{"key":"23_CR19","unstructured":"van\u00a0der Wulp, J.: The TEPARLA tool (Technische Universteit Eindhoven, The Netherlands), http:\/\/www.win.tue.nl\/~hzantema\/torpa.html"},{"key":"23_CR20","unstructured":"Endrullis, J.: The JamBox tool (Free University in Amsterdam, The Netherlands), http:\/\/joerg.endrullis.de\/"},{"key":"23_CR21","unstructured":"Korp, M.: The TTTbox (Innsbruck Universit\u00e4t, Austria), http:\/\/homepage.uibk.ac.at\/~csad2836\/TTTbox.html"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Mu-term, a tool for proving termination of rewriting with replacement restrictions (2003), http:\/\/www.dsic.upv.es\/~slucas\/csr\/termination\/muterm\/","DOI":"10.1007\/978-3-540-25979-4_14"},{"key":"23_CR23","unstructured":"Hofbauer, D.: The MultumNonMulta tool (Kassel, Germany), http:\/\/www.theory.informatik.uni-kassel.de\/~dieter\/multum\/"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2005.12.011","volume":"98","author":"D. Hofbauer","year":"2006","unstructured":"Hofbauer, D., Waldmann, J.: Termination of {aa\u2192bc,bb\u2192ac,cc\u2192ab}. Information Processing Letters\u00a098(4), 156\u2013158 (2006)","journal-title":"Information Processing Letters"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11805618_25","volume-title":"Term Rewriting and Applications","author":"D. Hofbauer","year":"2006","unstructured":"Hofbauer, D., Waldmann, J.: Termination of string rewriting with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, Springer, Heidelberg (2006)"},{"key":"23_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"23_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11916277_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Codish","year":"2006","unstructured":"Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: Sat solving for argument filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 30\u201344. Springer, Heidelberg (2006)"},{"key":"23_CR28","series-title":"Lecture Notes in Artificial Intelligence","first-page":"216","volume-title":"FroCoS","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCoS. LNCS (LNAI), vol.\u00a03717, pp. 216\u2013231. Springer, Heidelberg (2005)"},{"key":"23_CR29","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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.A. (eds.) AISC 2004. LNCS (LNAI), vol.\u00a03249, pp. 185\u2013198. Springer, Heidelberg (2004)"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 249\u2013268. Springer, Heidelberg (2004)"},{"issue":"4","key":"23_CR31","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.ic.2006.08.007","volume":"205","author":"A. Geser","year":"2007","unstructured":"Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: On tree automata that certify termination of left-linear term rewriting systems. Information and Computation\u00a0205(4), 512\u2013534 (2007)","journal-title":"Information and Computation"},{"key":"23_CR32","unstructured":"Blanqui, F.: CoLoR project (INRIA Lorraine, France), http:\/\/color.loria.fr\/"},{"key":"23_CR33","unstructured":"Urbain, X., Forest, J., Courtieu, P.: The A3PAT project (C\u00e9dric, CNAM, Paris, France), http:\/\/www3.ensiie.fr\/~urbain\/a3pat"},{"key":"23_CR34","unstructured":"Podelski, A.: The TERMINATOR project (Microsoft Research, Cambridge, UK), http:\/\/research.microsoft.com\/TERMINATOR\/"},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"RTA 2007","author":"H. Zantema","year":"2007","unstructured":"Zantema, H., Waldmann, J.: Termination by quasi-periodic interpretations. In: Baader, F. (ed.) RTA 2007. LNCS, Springer, Heidelberg (2007)"},{"key":"23_CR36","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"E. Contejean","year":"1997","unstructured":"Contejean, E., March\u00e9, C., Rabehasaina, L.: Rewrite systems for natural, integral, and rational arithmetic. In: Comon, H. (ed.) Rewriting Techniques and Applications. LNCS, vol.\u00a01232, Springer, Heidelberg (1997)"},{"key":"23_CR37","unstructured":"Deplagne, \u00c9.: Sequent Calculus Viewed Modulo. In: Pili\u00e8re, C. (ed.) ESSLLI Student Session, Univ. Birmingham, pp. 66\u201376 (2000)"},{"key":"23_CR38","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":"23_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-53904-2_100","volume-title":"RTA\u201991.","author":"D. Cohen","year":"1991","unstructured":"Cohen, D., Watson, P.: An efficient representation of arithmetic for term rewriting. In: Book, R.V. (ed.) RTA\u201991. LNCS, vol.\u00a0488, pp. 240\u2013251. Springer, Heidelberg (1991)"}],"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_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:14:50Z","timestamp":1605744890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}