{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:32Z","timestamp":1725566732612},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_18","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"248-262","source":"Crossref","is-referenced-by-count":19,"title":["An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Tiwari","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-45620-1_17","volume-title":"Automated Deduction - CADE-18","author":"G. Audemard","year":"2002","unstructured":"Audemard, G., Bertoli, P., Cimatti, A., Kornilowicz, A., Sebastiani, R.: A SAT based approach for solving formulas over boolean and linear mathematical propositions. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 195\u2013210. Springer, Heidelberg (2002)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0016860","volume-title":"Constraints in Computational Logics","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Buchberger\u2019s algorithm: A constraint-based completion procedure. In: Jouannaud, J.-P. (ed.) CCL 1994. LNCS, vol.\u00a0845, Springer, Heidelberg (1994)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","first-page":"113","volume-title":"Rewriting Techniques and Applications","author":"L. Bachmair","year":"1996","unstructured":"Bachmair, L., Tiwari, A.: D-bases for polynomial ideals over commutative noetherian rings. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 113\u2013127. Springer, Heidelberg (1996)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Basu, S., Gonzalez-Vega, L. (eds.): Algorithmic and Quantitative Real Algebraic Geometry. DIMACS Series in DMTCS, vol.\u00a060 (2003)","DOI":"10.1090\/dimacs\/060"},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S. Basu","year":"1996","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM\u00a043(6), 1002\u20131045 (1996)","journal-title":"J. of the ACM"},{"key":"18_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry","author":"J. Bochnak","year":"1998","unstructured":"Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Springer, Heidelberg (1998)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"G.E. Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 134\u2013183. Springer, Heidelberg (1975)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Datta, R.S.: Using computer algebra to compute Nash equilibria. In: Intl. Symp. on Symbolic and Algebraic Computation, ISSAC 2003, pp. 74\u201379 (2003)","DOI":"10.1145\/860854.860879"},{"key":"18_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-25984-8_14","volume-title":"Automated Reasoning","author":"L. Moura de","year":"2004","unstructured":"de Moura, L., Owre, S., Rue\u00df, H., Rushby, J., Shankar, N.: The ICS decision procedures for embedded deduction. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 218\u2013222. Springer, Heidelberg (2004)"},{"issue":"8","key":"18_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-4049(00)00148-1","volume":"164","author":"M. Einsiedler","year":"2001","unstructured":"Einsiedler, M., Tuncel, H.: When does a polynomial ideal contain a positive polynomial? J. Pure Appl. Algebra\u00a0164(1-2), 149\u2013152 (2001)","journal-title":"J. Pure Appl. Algebra"},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-1591-5","volume-title":"Theorem proving with the real numbers","author":"J. Harrison","year":"1998","unstructured":"Harrison, J.: Theorem proving with the real numbers. Springer, Heidelberg (1998)"},{"key":"18_CR13","unstructured":"Hong, H.: Quantifier elimination in elementary algebra and geometry by partial cylindrical algebraic decomposition version 13 (1995), http:\/\/www.gwdg.de\/~cais\/systeme\/saclib,www.eecis.udel.edu\/~saclib\/"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02807438","volume":"12","author":"J.L. Krivine","year":"1964","unstructured":"Krivine, J.L.: Anneaux preordonnes. J. Anal. Math.\u00a012, 307\u2013326 (1964)","journal-title":"J. Anal. Math."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-31954-2_3","volume-title":"Hybrid Systems: Computation and Control","author":"P.A. Parrilo","year":"2005","unstructured":"Parrilo, P.A.: SOS methods for semi-algebraic games and optimization. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol.\u00a03414, p. 54. Springer, Heidelberg (2005)"},{"key":"18_CR16","unstructured":"Prajna, S., Papachristodoulou, A., Parrilo, P.A.: SOSTOOLS: Sum of Square Optimization Toolbox (2002), http:\/\/www.cds.caltech.edu\/sostools"},{"key":"18_CR17","unstructured":"Ratschan, S.: Applications of quantified constraint solving over the reals: Bibliography (2004), http:\/\/www.mpi-sb.mpg.de\/~ratschan\/appqcs.html"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first order theory of the reals. J. of Symbolic Computation\u00a013(3), 255\u2013352 (1992)","journal-title":"J. of Symbolic Computation"},{"key":"18_CR19","unstructured":"Roy, M.-F.: Degree bounds for Stengle\u2019s Positivstellensatz. In: Network workshop on real algebra (2003), http:\/\/ihp-raag.org\/index.php"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G. Stengle","year":"1974","unstructured":"Stengle, G.: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Math. Ann.\u00a0207, 87\u201397 (1974)","journal-title":"Math. Ann."},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-45657-0_40","volume-title":"Computer Aided Verification","author":"A. Stump","year":"2002","unstructured":"Stump, A., Barrett, C.W., Dill, D.L.: CVC: A cooperating validity checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 500\u2013504. Springer, Heidelberg (2002)"},{"key":"18_CR22","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press (1948)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45873-5_36","volume-title":"Hybrid Systems: Computation and Control","author":"A. Tiwari","year":"2002","unstructured":"Tiwari, A., Khanna, G.: Series of abstractions for hybrid automata. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol.\u00a02289, pp. 465\u2013478. Springer, Heidelberg (2002)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Weispfenning, V.: The complexity of linear problems in fields. J. of Symbolic Computation\u00a05 (1988)","DOI":"10.1016\/S0747-7171(88)80003-8"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:38Z","timestamp":1605644018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11538363_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}