{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:58:26Z","timestamp":1740895106959,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232124"},{"type":"electronic","value":"9783540302100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30210-0_16","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:34:36Z","timestamp":1295346876000},"page":"185-198","source":"Crossref","is-referenced-by-count":18,"title":["Polynomial Interpretations with Negative Coefficients"],"prefix":"10.1007","author":[{"given":"Nao","family":"Hirokawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aart","family":"Middeldorp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_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":"16_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 (2001)"},{"key":"16_CR3","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":"16_CR4","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\u2013159 (1987)","journal-title":"Science of Computer Programming"},{"key":"16_CR5","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME version 2 (2000), Available at http:\/\/cime.lri.fr\/"},{"key":"16_CR6","unstructured":"Contejean, E., March\u00e9, C., Tom\u00e1s, A.-P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Research Report 1382, LRI (2004)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Term Rewriting","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 Examples of termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol.\u00a0909, pp. 16\u201326. Springer, Heidelberg (1995)"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N., Hoot, C.: Natural termination. Theoretical Computer Science\u00a0142(2), 179\u2013207 (1995)","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-59200-8_77","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"1995","unstructured":"Giesl, J.: Generating polynomial orderings for termination proofs. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 426\u2013431. Springer, Heidelberg (1995)"},{"issue":"1","key":"16_CR10","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":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"16_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-45085-6_4","volume-title":"Automated Deduction \u2013 CADE-19","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"16_CR14","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Proc. 7th Internation Workshop on Termination, Technical Report AIB-2004-07, RWTH Aachen, pp. 59\u201362 (2004)"},{"key":"16_CR15","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, 23\u201328 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR16","unstructured":"Lankford, D.: On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA (1979)"},{"key":"16_CR17","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":"16_CR18","doi-asserted-by":"crossref","unstructured":"Lucas, S.: Polynomials over the reals in proof of termination. In: Proc. 7th Internation Workshop on Termination, Technical Report AIB-2004-07, RWTH Aachen, pp. 39\u201342 (2004)","DOI":"10.1145\/1273920.1273927"},{"key":"16_CR19","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":"16_CR20","unstructured":"Steinbach, J., K\u00fchler, U.: Check your ordering \u2013 termination proofs and open problems. Technical Report SR-90-25, Universit\u00e4t Kaiserslautern (1990)"},{"key":"16_CR21","unstructured":"Terese. Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-25984-8_4","volume-title":"Automated Reasoning","author":"R. Thiemann","year":"2004","unstructured":"Thiemann, R., Giesl, J., Schneider-Kamp, P.: Improved modular termination proofs using dependency pairs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 75\u201390. Springer, Heidelberg (2004)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Urbain, X.: Modular & incremental automated termination proofs. Journal of Automated Reasoning (2004) (to appear)","DOI":"10.1007\/BF03177743"},{"key":"16_CR24","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"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30210-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T22:09:45Z","timestamp":1740866985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30210-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232124","9783540302100"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30210-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}