An algebraic approach for the unsatisfiability of nonlinear constraints

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 248-262

  Tiwari, Ashish ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FORMAL LOGIC; NONLINEAR EQUATIONS; PROBLEM SOLVING;

LINEAR CONSTRAINTS; LOGICAL PROCEDURES; SEMI-DECISION PROCEDURES; SIMPLEX METHOD;

ALGEBRA;

EID: 26944482707     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_18     Document Type: Conference Paper

References (24)

1. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In CADE, volume 2392 of LNCS, pages 195-210. Springer, 2002.
2. L. Bachmair and H. Ganzinger. Buchberger's algorithm: A constraint-based completion procedure. In CCL, volume 845 of LNCS. Springer, 1994.
3. L. Bachmair and A. Tiwari. D-bases for polynomial ideals over commutative noetherian rings. In RTA, volume 1103 of LNCS, pages 113-127. Springer, 1997.
4. S. Basu and L. Gonzalez-Vega, editors. Algorithmic and Quantitative Real Algebraic Geometry, volume 60 of DIMACS Series in DMTCS, 2003.
5. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. J. of the ACM, 43(6): 1002-1045, 1996.
6. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry. Springer, 1998.
7. G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Proc. 2nd GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134-183. Springer, 1975.
8. R. S. Datta. Using computer algebra to compute Nash equilibria. In Intl. Symp. on Symbolic and Algebraic Computation, ISSAC 2003, pages 74-79, 2003.
9. L. de Moura, S. Owre, H. Rueß, J. Rushby, and N. Shankar. The ICS decision procedures for embedded deduction. In IJCAR, volume 3097 of LNAI. Springer, 2004.
10. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465-476, 1979.
11. M. Einsiedler and H. Tuncel. When does a polynomial ideal contain a positive polynomial? J. Pure Appl. Algebra, 164(1-2):149-152, 2001.
12. J. Harrison. Theorem proving with the real numbers. Springer-Verlag, 1998.
13. H. Hong. 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/.
14. J. L. Krivine. Anneaux preordonnes. J. Anal. Math., 12:307-326, 1964.
15. P. A. Parrilo. SOS methods for semi-algebraic games and optimization. In HSCC 2005. volume 3414 of LNCS, page 54. Springer, 2005.
16. S. Prajna, A. Papachristodoulou, and P. A. Parrilo. SOSTOOLS: Sum of Square Optimization Toolbox, 2002. http://www.cds.caltech.edu/sostools.
17. S. Ratschan. Applications of quantified constraint solving over the reals: Bibliography, 2004. http://http://www.mpi-sb.mpg.de/~ratschan/appqcs. html.
18. J. Renegar. On the computational complexity and geometry of the first order theory of the reals. J. of Symbolic Computation, 13(3):255-352, 1992.
19. M.-F. Roy. Degree bounds for Stengle's Positivstellensatz, 2003. Network workshop on real algebra. http://ihp-raag.org/index.php.
20. G. Stengle. A Nullstellensatz and a Positivstellensatz in semialgebraic geometry. Math. Ann., 207:87-97, 1974.
21. A. Stump, C. W. Barrett, and D. L. Dill. CVC: A cooperating validity checker. In CAV, volume 2404 of LNCS, pages 500-504. Springer, 2002.
22. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1948. Second edition.
23. A. Tiwari and G. Khanna. Series of abstractions for hybrid automata. In HSCC, volume 2289 of LNCS, pages 465-478. Springer, 2002.
24. V. Weispfenning. The complexity of linear problems in fields. J. of Symbolic Computation, 5, 1988.