Delta-Decidability over the Reals

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any sentence A containing only bounded quantifiers and functions in F, and any positive rational number delta, decides either “A is true”, or “a delta-strengthening of A is false”. Moreover, if F can be computed in complexity class C, then under mild assumptions, this “delta-decision problem” for bounded Sigma k-sentences resides in Sigma k(C). The results stand in sharp contrast to the well-known undecidability of the general first-order theories with these functions, and serve as a theoretical basis for the use of numerical methods in decision procedures for formulas over the reals.

[1]  Stefan Ratschan,et al.  Quantified Constraints Under Perturbation , 2002, J. Symb. Comput..

[2]  Tobias Nipkow,et al.  A Revision of the Proof of the Kepler Conjecture , 2009, Discret. Comput. Geom..

[3]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[4]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[5]  Ahmed Bouajjani,et al.  Perturbed Turing machines and hybrid systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[6]  Edmund M. Clarke,et al.  δ-Complete Decision Procedures for Satisfiability over the Reals , 2012, IJCAR.

[7]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[8]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[9]  Malay K. Ganai,et al.  Efficient decision procedure for non-linear arithmetic constraints using CORDIC , 2009, 2009 Formal Methods in Computer-Aided Design.

[10]  Klaus Weihrauch,et al.  A Tutorial on Computable Analysis , 2008 .

[11]  Ker-I Ko,et al.  On the Computational Complexity of Integral Equations , 1992, Ann. Pure Appl. Log..

[12]  Daniel S. Graça,et al.  Robust Simulations of Turing Machines with Analytic Maps and Flows , 2005, CiE.

[13]  Akitoshi Kawamura,et al.  Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[14]  Thomas C. Hales,et al.  Introduction to the Flyspeck Project , 2005, Mathematics, Algorithms, Proofs.

[15]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[16]  Eugene Asarin,et al.  Noisy Turing Machines , 2005, ICALP.

[17]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[18]  Sriram Sankaranarayanan,et al.  Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems , 2010, Formal Methods in Computer Aided Design.

[19]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

[20]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[21]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[22]  Stefan Ratschan.  Applications of Quantified Constraint Solving over the Reals - Bibliography , 2012, ArXiv.

[23]  Lawrence C. Paulson,et al.  Applications of MetiTarski in the Verification of Control and Hybrid Systems , 2009, HSCC.

[24]  Stefan Ratschan,et al.  Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable , 2011, MFCS.

[25]  M. Laczkovich,et al.  The removal of from some undecidable problems involving elementary functions , 2002 .

[26]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.