{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:49:08Z","timestamp":1725558548471},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141270"},{"type":"electronic","value":"9783642141287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14128-7_11","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T10:45:36Z","timestamp":1277808336000},"page":"116-131","source":"Crossref","is-referenced-by-count":1,"title":["From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Alarc\u00f3n, B., Lucas, S., Navarro-Marset, R.: Proving Termination with Matrix Interpretations over the Reals. In: Proc. of WST 2009, pp. 12\u201315 (2009)"},{"key":"11_CR2","unstructured":"Alarc\u00f3n, B., Lucas, S., Navarro-Marset, R.: Using Matrix Interpretations over the Reals in Proofs of Termination. In: Proc. of PROLE 2009, pp. 255\u2013264 (2009)"},{"key":"11_CR3","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":"11_CR4","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":"11_CR5","series-title":"LNAI","first-page":"294","volume-title":"CADE 2009","author":"C. Borralleras","year":"2009","unstructured":"Borralleras, C., Lucas, S., Navarro-Marset, R., Rodr\u00edguez-Carbonell, E., Rubio, A.: Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol.\u00a05663, pp. 294\u2013305. Springer, Heidelberg (2009)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-73147-4_2","volume-title":"Rewriting, Computation and Proof","author":"C. Borralleras","year":"2007","unstructured":"Borralleras, C., Rubio, A.: Orderings and Constraints: Theory and Practice of Proving Termination. In: Comon-Lundh, H., Kirchner, C., Kirchner, H. (eds.) Jouannaud Festschrift. LNCS, vol.\u00a04600, pp. 28\u201343. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10817-005-9022-x","volume":"34","author":"E. Contejean","year":"2006","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 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR8","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\u2013115 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR9","unstructured":"Endrullis, J.: Jambox, Automated Termination Proofs For String and Term Rewriting, \n                    \n                      http:\/\/joerg.endrullis.de\/jambox.html"},{"issue":"2-3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10817-007-9087-9","volume":"40","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. Journal of Automated Reasoning\u00a040(2-3), 195\u2013220 (2008)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-85110-3_10","volume-title":"Intelligent Computer Mathematics","author":"C. Fuhs","year":"2008","unstructured":"Fuhs, C., Navarro-Marset, R., Otto, C., Giesl, J., Lucas, S., Schneider-Kamp, P.: Search Techniques for Rational Polynomial Orders. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC 2008, Calculemus 2008, and MKM 2008. LNCS (LNAI), vol.\u00a05144, pp. 109\u2013124. Springer, Heidelberg (2008)"},{"key":"11_CR12","volume-title":"The Theory of Matrices","author":"P. Lancaster","year":"1985","unstructured":"Lancaster, P., Tismenetsky, M.: The Theory of Matrices, 2nd edn. With Applications. Academic Press, London (1985)","edition":"2"},{"key":"11_CR13","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), \n                    \n                      http:\/\/zenon.dsic.upv.es\/muterm"},{"issue":"1","key":"11_CR14","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"},{"issue":"3","key":"11_CR15","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"},{"key":"11_CR16","first-page":"39","volume-title":"Proc. of PPDP 2007","author":"S. Lucas","year":"2007","unstructured":"Lucas, S.: Practical use of polynomials over the reals in proofs of termination. In: Proc. of PPDP 2007, pp. 39\u201350. ACM Press, New York (2007)"},{"key":"11_CR17","volume-title":"Society for Industrial and Applied Mathematics","author":"C.D. Meyer","year":"2000","unstructured":"Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. In: Society for Industrial and Applied Mathematics. SIAM, Philadelphia (2000)"},{"key":"11_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5797-2","volume-title":"Matrix Theory","author":"F. Zhang","year":"1999","unstructured":"Zhang, F.: Matrix Theory. Springer, Berlin (1999)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14128-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:19:10Z","timestamp":1619785150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14128-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141270","9783642141287"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14128-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}