Combined decision techniques for the existential theory of the reals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5625 LNAI, Issue , 2009, Pages 122-137

  Passmore, Grant Olney ^a   Jackson, Paul B ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION METHOD; FORMAL VERIFICATIONS; HIGH DIMENSIONS; HIGH-DIMENSIONAL; NON-LINEAR; RATIONAL FUNCTION; REAL ALGEBRA; REAL-WORLD SYSTEM; SWEET SPOT; THEOREM PROVERS;

ALGEBRA; DECISION THEORY; FUNCTION EVALUATION; KNOWLEDGE MANAGEMENT;

PROBLEM SOLVING;

EID: 69049104267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02614-0_14     Document Type: Conference Paper

References (21)

1. Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. SIGSAM Bull. 37(4), 97-108 (2003)
2. Cohen, P.J.: Decision procedures for real and p-adic fields. Comm. Pure and Applied Mathematics XXII(2), 131-151 (1969)
3. 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. 33, pp. 134-183. Springer, Heidelberg (1975)
4. Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. Journal of Symbolic Computing 5(1-2), 29-35 (1988)
5. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201-215 (1960)
6. Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: ISSAC 2004: Proceedings of the 2004 international symposium on Symbolic and algebraic computation, pp. 111-118. ACM Press, New York (2004)
7. Dolzmann, A., Sturm, T.: Redlog: computer algebra meets computer logic. SIGSAM Bull. 31(2), 2-9 (1997)
8. Dutertre, B., de Moura, L.: The YICES SMT solver (2006), http://yices.csl.sri.com/tool-paper.pdf
9. Yu Grigor'ev, D., Vorobjov Jr., N.N.: Solving systems of polynomial inequalities in subexponential time. Journal of Symbolic Computation 5(1,2), 37-64 (1988)
10. Hales, T.C.: Formalizing the proof of the Kepler Conjecture. In: Theorem Proving in Higher Order Logics (TPHOLs) (2004)
11. Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 102-118. Springer, Heidelberg (2007)
12. Hong, H.: Comparison of several decision algorithms for the existential theory of the reals. Technical report, RISC Linz (1991)
13. Laplagne, S.: An algorithm for the computation of the radical of an ideal. In: International Symposium on Symbolic and Algebraic Computation (2006)
14. McCallum, S.: Solving polynomial strict inequalities using cylindrical algebraic decomposition. The Computer Journal 36(5) (1993)
15. McLaughlin, S., Harrison, J.V.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 295-314. Springer, Heidelberg (2005)
16. Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals (Part I). Technical Report 853, Cornell University (1989)
17. Tarski, A.: A decision method for elementary algebra and geometry. Technical report, Rand Corporation (1948)
18. Tiwari, A.: HybridSAL: Modeling and abstracting hybrid systems. Technical report, SRI International (2003)
19. Tiwari, A.: An algebraic approach for the unsatisfiability of nonlinear constraints. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 248-262. Springer, Heidelberg (2005)
20. van den Dries, L.: Tame topology and o-minimal structures. London Mathematical Society (1998)
21. Weispfenning, V.: Quantifier elimination for real algebra - the quadratic case and beyond. Applicable Algebra in Engineering Communication and Computing 8(2), 85-101 (1997)