{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:54:17Z","timestamp":1725814457891},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319137698"},{"type":"electronic","value":"9783319137704"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13770-4_4","type":"book-chapter","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T13:36:05Z","timestamp":1418045765000},"page":"21-33","source":"Crossref","is-referenced-by-count":0,"title":["Using Representation Theorems for Proving Polynomials Non-negative"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-17796-5_12","volume-title":"Algebraic Methodology and Software Technology","author":"B. Alarc\u00f3n","year":"2011","unstructured":"Alarc\u00f3n, B., Guti\u00e9rrez, R., Lucas, S., Navarro-Marset, R.: Proving Termination Properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol.\u00a06486, pp. 201\u2013208. Springer, Heidelberg (2011)"},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S. Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Berlin (2006)"},{"issue":"2","key":"4_CR3","first-page":"1","volume":"13","author":"S. Bernstein","year":"1912","unstructured":"Bernstein, S.: D\u00e9monstration du th\u00e9or\u00e8me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Communic. Soc. Math. de Kharkow\u00a013(2), 1\u20132 (1912)","journal-title":"Communic. Soc. Math. de Kharkow"},{"issue":"2","key":"4_CR4","first-page":"227","volume":"14","author":"S. Bernstein","year":"1915","unstructured":"Bernstein, S.: Sur la r\u00e9presentation des polyn\u00f4mes positifs. Communic. Soc. Math. de Kharkow\u00a014(2), 227\u2013228 (1915)","journal-title":"Communic. Soc. Math. de Kharkow"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10817-010-9196-8","volume":"48","author":"C. Borralleras","year":"2012","unstructured":"Borralleras, C., Lucas, S., Oliveras, A., Rodr\u00edguez, E., Rubio, A.: SAT Modulo Linear Arithmetic for Solving Polynomial Constraints. Journal of Automated Reasoning\u00a048, 107\u2013131 (2012)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s00454-007-9042-x","volume":"39","author":"F. Boudaoud","year":"2008","unstructured":"Boudaoud, F., Caruso, F., Roy, M.-F.: Certificates of Positivity in the Bernstein Basis. Discrete Computational Geometry\u00a039, 639\u2013655 (2008)","journal-title":"Discrete Computational Geometry"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Choi, M.D., Lam, T.Y., Reznick, B.: Sums of squares of real polynomials. In: Proc. of the Symposium on Pure Mathematics, vol.\u00a04, pp. 103\u2013126. American Mathematical Society (1995)","DOI":"10.1090\/pspum\/058.2\/1327293"},{"issue":"4","key":"4_CR8","first-page":"315","volume":"32","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\u00a032(4), 315\u2013355 (2006)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BF01443605","volume":"32","author":"D. Hilbert","year":"1888","unstructured":"Hilbert, D.: \u00dcber die Darstellung definiter Formen als Summe von Formenquadraten. Mathematische Annalen\u00a032, 342\u2013350 (1888)","journal-title":"Mathematische Annalen"},{"key":"4_CR10","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\u201338 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR11","volume-title":"Tchebycheff systems: with applications in analysis and statistics","author":"S. Karlin","year":"1966","unstructured":"Karlin, S., Studden, W.J.: Tchebycheff systems: with applications in analysis and statistics. Interscience, New York (1966)"},{"issue":"3","key":"4_CR12","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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Polya, G., Szeg\u00f6, G.: Problems and Theorems in Analysis II. Springer (1976)","DOI":"10.1007\/978-1-4757-6292-1"},{"issue":"10","key":"4_CR14","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.1090\/S0002-9947-00-02595-2","volume":"352","author":"V. Powers","year":"2000","unstructured":"Powers, V., Reznick, B.: Polynomials that are positive on an interval. Transactions of the AMS\u00a0352(10), 4677\u20134692 (2000)","journal-title":"Transactions of the AMS"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0022-4049(97)83827-3","volume":"127","author":"V. Powers","year":"1998","unstructured":"Powers, V., W\u00f6rmann, T.: An algorithm for sums of squares of real polynomials. Journal of Pure and Applied Algebra\u00a0127, 99\u2013104 (1998)","journal-title":"Journal of Pure and Applied Algebra"}],"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-319-13770-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:44:12Z","timestamp":1559087052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13770-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319137698","9783319137704"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13770-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}