{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:57:54Z","timestamp":1725890274908},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851097"},{"type":"electronic","value":"9783540851103"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85110-3_10","type":"book-chapter","created":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T02:00:32Z","timestamp":1217037632000},"page":"109-124","source":"Crossref","is-referenced-by-count":10,"title":["Search Techniques for Rational Polynomial Orders"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Fuhs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Navarro-Marset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Giesl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_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":"10_CR2","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME, \n                      \n                        http:\/\/cime.lri.fr"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10817-005-9022-x","volume":"34","author":"E. Contejean","year":"2005","unstructured":"Contejean, E., March\u00e9, C., Tom\u00e1s, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning\u00a034(4), 325\u2013363 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR4","doi-asserted-by":"publisher","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\u00a03, 69\u2013116 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR5","unstructured":"Endrullis, J.: Jambox, \n                      \n                        http:\/\/joerg.endrullis.de"},{"key":"10_CR6","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":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-72788-0_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"C. Fuhs","year":"2007","unstructured":"Fuhs, C., Giesl, J., Middeldorp, A., Thiemann, R., Schneider-Kamp, P., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 340\u2013354. Springer, Heidelberg (2007)"},{"key":"10_CR8","unstructured":"Gebhardt, A., Hofbauer, D., Waldmann, J.: Matrix Evolutions. In: Proc. WST 2007 (2007)"},{"key":"10_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"10_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11814771_24","volume-title":"Automated Reasoning","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Schneider-Kamp, P., Thiemann, R.: AProVE 1.2: Automatic termination proofs in the DP framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 281\u2013286. Springer, Heidelberg (2006)"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10817-006-9057-7","volume":"37","author":"J. Giesl","year":"2006","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning\u00a037(3), 155\u2013203 (2006)","journal-title":"Journal of Automated Reasoning"},{"issue":"1,2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ic.2004.10.004","volume":"199","author":"N. Hirokawa","year":"2005","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation\u00a0199(1,2), 172\u2013199 (2005)","journal-title":"Information and Computation"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.ic.2006.08.010","volume":"205","author":"N. Hirokawa","year":"2007","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool: Techniques and features. Information and Computation\u00a0205(4), 474\u2013511 (2007)","journal-title":"Information and Computation"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1023\/A:1005983105493","volume":"21","author":"H. Hong","year":"1998","unstructured":"Hong, H., Jaku\u0161, D.: Testing positiveness of polynomials. Journal of Automated Reasoning\u00a021(1), 23\u201338 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-25979-4_14","volume-title":"Rewriting Techniques and Applications","author":"S. Lucas","year":"2004","unstructured":"Lucas, S.: MU-TERM: a tool for proving termination of context-sensitive rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 200\u2013209. Springer, Heidelberg (2004)"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1051\/ita:2005029","volume":"39","author":"S. Lucas","year":"2005","unstructured":"Lucas, S.: Polynomials over the reals in proofs of termination: From theory to practice. RAIRO Theoretical Informatics and Applications\u00a039(3), 547\u2013586 (2005)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00200-005-0189-5","volume":"17","author":"S. Lucas","year":"2006","unstructured":"Lucas, S.: On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Applicable Algebra in Engineering, Communication and Computing\u00a017(1), 49\u201373 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"10_CR18","first-page":"39","volume-title":"Proc. PPDP 2007","author":"S. Lucas","year":"2007","unstructured":"Lucas, S.: Practical use of polynomials over the reals in proofs of termination. In: Proc. PPDP 2007, pp. 39\u201350. ACM Press, New York (2007)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-73449-9_23","volume-title":"Term Rewriting and Applications","author":"C. March\u00e9","year":"2007","unstructured":"March\u00e9, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 303\u2013313. Springer, Heidelberg (2007)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Thiemann, R., Middeldorp, A.: Innermost termination of rewrite systems by labeling. In: Proc. WRS 2007. ENTCS 204, pp. 3\u201319 (2008)","DOI":"10.1016\/j.entcs.2008.03.050"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85110-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:37Z","timestamp":1619507677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85110-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851097","9783540851103"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85110-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}