Combined Decision Techniques for the Existential Theory of the Reals
Methods for deciding quantifier-free non-linear arithmetical conjectures over ℝ are crucial in the formal verification of many real-world systems and in formalised mathematics. While non-linear (rational function) arithmetic over ℝ is decidable, it is fundamentally infeasible: any general decision method for this problem is worst-case exponential in the dimension (number of variables) of the formula being analysed. This is unfortunate, as many practical applications of real algebraic decision methods require reasoning about high-dimensional conjectures. Despite their inherent infeasibility, a number of different decision methods have been developed, most of which have “sweet spots” – e.g., types of problems for which they perform much better than they do in general. Such “sweet spots” can in many cases be heuristically combined to solve problems that are out of reach of the individual decision methods when used in isolation. RAHD (“Real Algebra in High Dimensions”) is a theorem prover that works to combine a collection of real algebraic decision methods in ways that exploit their respective “sweet-spots.” We discuss high-level mathematical and design aspects of RAHD and illustrate its use on a number of examples.
KeywordsStrict Inequality Decision Method Disjunctive Normal Form Existential Theory Sweet Spot
Unable to display preview. Download preview PDF.
- 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)Google Scholar
- 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)Google Scholar
- 8.Dutertre, B., de Moura, L.: The YICES SMT solver (2006), http://yices.csl.sri.com/tool-paper.pdf
- 10.Hales, T.C.: Formalizing the proof of the Kepler Conjecture. In: Theorem Proving in Higher Order Logics (TPHOLs) (2004)Google Scholar
- 12.Hong, H.: Comparison of several decision algorithms for the existential theory of the reals. Technical report, RISC Linz (1991)Google Scholar
- 13.Laplagne, S.: An algorithm for the computation of the radical of an ideal. In: International Symposium on Symbolic and Algebraic Computation (2006)Google Scholar
- 14.McCallum, S.: Solving polynomial strict inequalities using cylindrical algebraic decomposition. The Computer Journal 36(5) (1993)Google Scholar
- 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)Google Scholar
- 17.Tarski, A.: A decision method for elementary algebra and geometry. Technical report, Rand Corporation (1948)Google Scholar
- 18.Tiwari, A.: HybridSAL: Modeling and abstracting hybrid systems. Technical report, SRI International (2003)Google Scholar
- 20.van den Dries, L.: Tame topology and o-minimal structures. London Mathematical Society (1998)Google Scholar