International Symposium on Frontiers of Combining Systems

Frontiers of Combining Systems pp 151-166 | Cite as

Adapting Real Quantifier Elimination Methods for Conflict Set Computation

  • Maximilian Jaroschek
  • Pablo Federico Dobal
  • Pascal Fontaine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9322)

Abstract

The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance. One of the central problems is the computation of good explanations of the unsatisfiability of such sets, i.e. obtaining a small subset of the input constraints whose conjunction is already unsatisfiable. We adapt two commonly used real quantifier elimination methods, cylindrical algebraic decomposition and virtual substitution, to provide such conflict sets and demonstrate the performance of our method in practice.

Keywords

SMT real quantifier elimination cylindrical algebraic decomposition virtual substitution conflict set 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, chapter 26, pp. 825–885. IOS Press, February 2009Google Scholar
  2. 2.
    Barrett, C.W.: Checking validity of quantifier-free formulas in combinations of first-order theories. PhD thesis, Stanford University (2003)Google Scholar
  3. 3.
    Barsotti, D., Nieto, L.P., Tiu, A.: Verification of clock synchronization algorithms: experiments on a combination of deductive tools. Form. Asp. Comput. 19(3), 321–341 (2007)CrossRefMATHGoogle Scholar
  4. 4.
    Brown, C.W.: Qepcad b: A program for computing with semi-algebraic sets using cads. SIGSAM Bulletin 37, 97–108 (2003)CrossRefMATHGoogle Scholar
  5. 5.
    Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, pp. 54–60. ACM, New York (2007)CrossRefGoogle Scholar
  6. 6.
    Brown, C.W., Kosta, M.: Constructing a single cell in cylindrical algebraic decomposition. J. Symb. Comput. 70, 14–48 (2015)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Feng, R., Lee, W.-S., Sato, Y. (eds.) Computer Mathematics, pp. 199–221. Springer, Heidelberg (2014)Google Scholar
  8. 8.
    Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition–preliminary report. SIGSAM Bull. 8(3), 80–90 (1974)CrossRefGoogle Scholar
  9. 9.
    Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation 12(3), 299–328 (1991)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Corzilius, F., Loup, U., Junges, S., Ábrahám, E.: SMT-RAT: An SMT-compliant nonlinear real arithmetic toolbox. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 442–448. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  11. 11.
    Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. Journal of Symbolic Computation 5(1), 29–35 (1988)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    de Moura, L.M., Bjørner, N.: Model-based theory combination. Electronic Notes in Theoretical Computer Science 198(2), 37–49 (2008)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    de Oliveira, D.C.B., Déharbe, D., Fontaine, P.: Combining decision procedures by (model-)equality propagation. Science of Computer Programming 77(4), 518–532 (2012)CrossRefMATHGoogle Scholar
  14. 14.
    Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, Hewlett Packard Laboratories, July 23, 2003Google Scholar
  15. 15.
    Dolzmann, A.: Algorithmic strategies for applicable real quantifier elimination. PhD thesis, Universität Passau, Innstrasse 29, 94032 Passau (2000)Google Scholar
  16. 16.
    Dolzmann, A., Sturm, T.: Redlog: Computer algebra meets computer logic. SIGSAM Bull. 31(2), 2–9 (1997)CrossRefGoogle Scholar
  17. 17.
    Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulae over ordered fields. Journal of Symbolic Computation 24(2), 209–231 (1997)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Hearn, A.C., Schöpf, R.: Reduce User’s Manual, Free Version, October 2014Google Scholar
  19. 19.
    Jovanović, D., de Moura, L.: Solving non-linear arithmetic. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol. 7364, pp. 339–354. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  20. 20.
    King, T., Barrett, C., Tinelli, C.: Leveraging linear and mixed integer programming for SMT. In: Claessen, K., Kuncak, V. (eds.) Formal Methods In Computer-Aided Design (FMCAD), Austin, TX, October, pp. 24:139–24:146. FMCAD Inc. (2014)Google Scholar
  21. 21.
    Kosta, M., Sturm, T., Dolzmann, A.: Better answers to real questions. CoRR, abs/1501.05098 (2015)Google Scholar
  22. 22.
    Nelson, G., Oppen, D.C.: Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)CrossRefMATHGoogle Scholar
  23. 23.
    Tarski, A.: A decision method for elementary algebra and geometry. Rand report. Rand Corporation, 1948. Republished as A Decision Method for Elementary Algebra and Geometry, 2nd edn. University of California Press, Berkeley (1951)Google Scholar
  24. 24.
    Weispfenning, V.: The complexity of linear problems in fields. Journal of Symbolic Computation 5(1–2), 3–27 (1988)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Weispfenning, V.: A new approach to quantifier elimination for real algebra. Technical Report MIP-9305, FMI, Universität Passau, Germany, July 1993Google Scholar
  26. 26.
    Weispfenning, V.: Quantifier elimination for real algebra – the quadratic case and beyond. AAECC 8, 85–101 (1993)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Weispfenning, V.: Quantifier elimination for real algebra – the cubic case. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, pp. 258–263. ACM, New York (1994)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Maximilian Jaroschek
    • 1
  • Pablo Federico Dobal
    • 1
    • 2
    • 3
  • Pascal Fontaine
    • 3
  1. 1.Max Planck Institute for InformaticsSaarbrückenGermany
  2. 2.Universität des SaarlandesSaarbrückenGermany
  3. 3.INRIA, Université de Lorraine and LORIANancyFrance

Personalised recommendations