Combining decision procedures for the reals

We address the general problem of determining the validity of boolean com- binations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted forms of distributiv- ity. At the same time, we explore ways in which "local" decision or heuristic procedures for fragments of the theory of the reals can be amalgamated into global ones. Let Tadd(Q) be the first-order theory of the real numbers in the language with symbols 0,1,+, , <, . . . , fa, . . . where for each a 2 Q, fa denotes the function fa(x) = ax. Let Tmult(Q) be the analogous theory for the language with symbols 0,1,×,÷, <, . . . , fa, . . .. We show that although T(Q) = Tadd(Q) ( Tmult(Q) is undecidable, the universal fragment of T(Q) is decidable. We also show that terms of T(Q) can fruitfully be put in a normal form. We prove analogous results for theories in which Q is replaced, more generally, by suitable subfields F of the reals. Finally, we consider practical methods of establishing quantifier-free validities that approximate our (impractical) decidability results.

[1]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[2]  Thomas Sturm,et al.  Real Quantifier Elimination in Practice , 1997, Algorithmic Algebra and Number Theory.

[3]  Mark de Berg,et al.  Computational Geometry: Algorithms and Applications, Second Edition , 2000 .

[4]  Rüdiger Loos,et al.  Applying Linear Quantifier Elimination , 1993, Comput. J..

[5]  Sylvain Conchon,et al.  Strategies for combining decision procedures , 2003, Theor. Comput. Sci..

[6]  Silvio Ghilardi,et al.  Model-Theoretic Methods in Combined Constraint Satisfiability , 2004, Journal of Automated Reasoning.

[7]  John Harrison,et al.  A Proof-Producing Decision Procedure for Real Arithmetic , 2005, CADE.

[8]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[9]  Jeremy Avigad,et al.  A formally verified proof of the prime number theorem , 2005, TOCL.

[10]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[11]  B. F. Caviness,et al.  Quantifier Elimination and Cylindrical Algebraic Decomposition , 2004, Texts and Monographs in Symbolic Computation.

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

[13]  Michael Beeson.  Design principles of Mathpert: software to support education in algebra and calculus , 1998, Computer-Human Interaction in Symbolic Computation.

[14]  L. van den Dries,et al.  Tame Topology and O-minimal Structures , 1998 .

[15]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[16]  Cesare Tinelli,et al.  A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics , 2004, IJCAR.

[17]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

[18]  Alan Bundy,et al.  A General Setting for Flexibly Combining and Augmenting Decision Procedures , 2004, Journal of Automated Reasoning.

[19]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[20]  David Detlefs,et al.  Simplify: a theorem prover for program checking , 2005, JACM.

[21]  Warren A. Hunt,et al.  Linear and Nonlinear Arithmetic in ACL2 , 2003, CHARME.

[22]  Christophe Ringeissen,et al.  Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn , 2004, ICTAC.

[23]  Saugata Basu,et al.  New results on quantifier elimination over real closed fields and applications to constraint databases , 1999, JACM.

[24]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[25]  S. Basu,et al.  Algorithms in real algebraic geometry , 2003 .

[26]  Charles Steinhorn,et al.  Tame Topology and O-Minimal Structures , 2008 .

[27]  J. Harrison.  Introduction to Logic and Automated Theorem Proving , 2007 .