Combining decision procedures for the reals

Logical Methods in Computer Science

Volumn 2, Issue 4, 2006, Pages

  Avigad, Jeremy ^a   Friedman, Harvey ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Decision procedures; Nelson Oppen methods; Real inequalities; Universal sentences

Indexed keywords

COMPUTABILITY AND DECIDABILITY; HEURISTIC METHODS;

BOOLEAN COMBINATIONS; DECISION PROCEDURE; FIRST ORDER THEORIES; HEURISTIC PROCEDURES; NELSON-OPPEN METHOD; PRACTICAL METHOD; REAL INEQUALITIES; UNIVERSAL SENTENCES;

DECISION THEORY;

EID: 84862233869     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(4:4)2006     Document Type: Article

References (28)

1. Krzysztof Apt. Principles of Constraint Programming. Cambridge University Press, Cambridge, 2003.
2. Jeremy Avigad, Kevin Donnelly, David Gray, and Paul Raff. A formally verified proof of the prime number theorem. To appear in ACM Transactions on Computational Logic.
3. Franz Baader, Silvio Ghilardi, and Cesare Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. In David A. Basin and Micha¨el Rusinowitch, editors, IJCAR ’04, pages 183-197. Springer-Verlag, Berlin, 2004.
4. Clark Wayne Barrett. Checking Validity of Quantifier-free Formulas in Combinations of First-order Theories. PhD thesis, Stanford University, 2002.
5. Saugata Basu. New results on quantifier elimination over real closed fields and applications to constraint databases. Journal of the ACM, 46:537-555, 1999.
6. Saugata Basu, Richard Pollack, and Marie-Françoise Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, Berlin, 2003.
7. Michael Beeson. Design principles of Mathpert: software to support education in algebra and calculus. In N. Kajler, editor, Computer-Human Interaction in Symbolic Computation, pages 89-115. Springer-Verlag, Berlin, 1998.
8. B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer-Verlag, Vienna, 1998.
9. C. C. Chang and H. Jerome Keisler. Model theory. North-Holland, Amsterdamn, third edition, 1990.
10. George E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Automata Theory and Formal Languages (Second GI Conf., Kaiserslautern, 1975), pages 134-183. Springer-Verlag, Berlin, 1975. Reprinted in[8].
11. S. Conchon and S. Krstić. Strategies for combining decision procedures. In P. Narendran and M. Rusinowitch, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 537-553. Springer-Verlag, Berlin, 2003.
12. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwartzkopf. Computational Geometry: Algorithms and Applications. Second edition. Springer-Verlag, Berlin, 2000.
13. David Detlefs, Greg Nelson and James B. Saxe. Simplify: a theorem prover for program checking. Journal of the ACM, 52:365-473, 2005.
14. Andreas Dolzmann, Thomas Sturm, and Volker Weispfenning. Real quantifier elimination in practice. In B. H. Matzat, G.-M. Greuel, and G. Hiss, editors, Algorithmic Algebra and Number Theory, pages 221-248. Springer-Verlag, Berlin, 1998.
15. Silvio Ghilardi. Model-theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 33:221-249, 2004.
16. John Harrison. Introduction to Logic and Automated Theorem Proving. In preparation.
17. Warren A. Hunt, Robert Bellarmine Krug, and J. Moore. Linear and nonlinear arithmetic in ACL2. In Daniel Geist and Enrico Tronci, editors, Correct Hardware Design and Verification Methods, Proceedings of CHARME 2003, pages 319-333. Springer-Verlag, Berlin, 2003.
18. Predrag Janičić and Alan Bundy. A general setting for flexibly combining and augmenting decision procedures. Journal of Automated Reasoning, 28:257-305, 2002.
19. Rüdiger Loos and Volker Weispfenning. Applying linear quantifier elimination. The Computer Journal, 36:450-461, 1993.
20. Sean McLaughlin and John Harrison. A proof producing decision procedure for real arithmetic. In Robert Nieuwenhuis, editor, Automated Deduction-CADE-20. 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings, pages 295-314, 2005.
21. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1:245-257, 1979.
22. Silvio Ranise, Christophe Ringeissen, and Duc-Khanh Tran. Nelson-Oppen, Shostak and the extended canonizer: A family picture with a newborn. In Zhiming Liu and Keijiro Araki, editors, ICTAC, pages 372-386. Springer-Verlag, Berlin, 2004.
23. Alfred Tarski. A Decision Procedure for Elementary Algebra and Geometry. Prepared for publication by J. C. C. McKinsey. University of California Press, second edition edition, 1951. Reprinted in[8].
24. Cesare Tinelli and Mehdi T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Franz Baader and Klaus U. Schulz, editors, Frontiers of Combining Systems (FroCos), pages 103-119. Kluwer Academic Publishers, 1996.
25. A. Tiwari. Abstraction based theorem proving: An example from the theory of reals. In C. Tinelli and S. Ranise, editors, Proceedings of the CADE-19 Workshop on Pragmatics of Decision Procedures in Automated Deduction, PDPAR 2003, pages 40-52. INRIA, Nancy, 2003.
26. Lou van den Dries. Tame Topology and O-minimal Structures. Cambridge University Press, Cambridge, 1998.
27. Volker Weispfenning. The complexity of linear problems in fields. Journal of Symbolic Computation, 5:3-27, 1988.
28. Volker Weispfenning. Mixed real-integer linear quantifier elimination. In S. Dooley, editor, Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, ISSAC ’99, pages 129-136. ACM Press, 1999.