Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Automated Reasoning

IJCAR 2016: Automated Reasoning pp 228–237Cite as

raSAT: An SMT Solver for Polynomial Constraints

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9706))

Abstract

This paper presents the raSAT SMT solver for polynomial constraints, which aims to handle them over both reals and integers with simple unified methodologies: (1) raSAT loop for inequalities, which extends the interval constraint propagation with testing to accelerate SAT detection, and (2) a non-constructive reasoning for equations over reals, based on the generalized intermediate value theorem.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Available at http://www.jaist.ac.jp/~s1310007/raSAT/index.html.

  2. 2.

    Available at http://irram.uni-trier.de.

  3. 3.

    https://github.com/smtrat/smtrat/releases/download/v2.0/rat1_linux64.zip.

  4. 4.

    http://smtlib.cs.uiowa.edu/benchmarks.shtml.

References

  1. Alliot, J.M., Gotteland, J.B., Vanaret, C., Durand, N., Gianazza, D.: Implementing an interval computation library for OCaml on x86/amd64 architectures. In: ICFP. ACM (2012)

    Google Scholar 

  2. Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: van Beek, P., Rossi, F., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 571–604. Elsevier, Amsterdam (2006)

    Chapter  Google Scholar 

  3. Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Rubio, A.: The barcelogic SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 294–298. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Comba, J.L.D., Stolfi, J.: Affine arithmetic and its applications to computer graphics. In: SIBGRAPI 1993, pp. 9–18 (1993)

    Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Fränzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. JSAT 1, 209–236 (2007)

    MATH  Google Scholar 

  8. Ganai, M., Ivancic, F.: Efficient decision procedure for non-linear arithmetic constraints using cordic. In: FMCAD 2009, pp. 61–68, November 2009

    Google Scholar 

  9. Gao, S., Kong, S., Clarke, E.M.: Satisfiability modulo odes. In: FMCAD 2013, pp. 105–112, October 2013

    Google Scholar 

  10. Gao, S., Kong, S., Clarke, E.M.: \({\sf dReal}\): an SMT solver for nonlinear theories over the reals. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol. 7898, pp. 208–214. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Granvilliers, L., Benhamou, F.: Realpaver: an interval solver using constraint satisfaction techniques. ACM Trans. Math. Softw. 32, 138–156 (2006)

    Article  MathSciNet  Google Scholar 

  12. Hickey, T., Ju, Q., Van Emden, M.H.: Interval arithmetic: from principles to implementation. J. ACM 48(5), 1038–1068 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. Khanh, T.V., Ogawa, M.: SMT for polynomial constraints on real numbers. In: TAPAS 2012. ENTCS, vol. 289, pp. 27–40 (2012)

    Google Scholar 

  15. Messine, F.: Extentions of affine arithmetic: application to unconstrained global optimization. J. UCS 8(11), 992–1015 (2002)

    MathSciNet  MATH  Google Scholar 

  16. Moore, R.: Interval Analysis. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Upper Saddle River (1966)

    MATH  Google Scholar 

  17. Neumaier, A.: Interval Methods for Systems of Equations. Cambridge Middle East Library. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  18. Passmore, G.O.: Combined decision procedures for nonlinear arithmetics, real and complex. Dissertation, School of Informatics, University of Edinburgh (2011)

    Google Scholar 

  19. Passmore, G.O., Jackson, P.B.: Combined decision techniques for the existential theory of the reals. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) MKM 2009, Held as Part of CICM 2009. LNCS, vol. 5625, pp. 122–137. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Trans. Comput. Logic 7(4), 723–748 (2006)

    Article  MathSciNet  Google Scholar 

  21. Tseitin, G.: On the complexity of derivation in propositional calculus. In: Siekmann, J.H., Wrightson, G. (eds.) Automation of Reasoning. Symbolic Computation, pp. 466–483. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  22. Tung, V.X., Khanh, T.V., Ogawa, M.: raSAT: SMT for polynomial inequality. In: SMT Workshop 2014, p. 67 (2014)

    Google Scholar 

  23. Zankl, H., Middeldorp, A.: Satisfiability of non-linear irrational arithmetic. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol. 6355, pp. 481–500. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Pascal Fontain and Nobert Müller for valuable comments and kind instructions on veriT and iRRAM. They also thank to anonymous referees for fruitful suggestions. This work is supported by JSPS KAKENHI Grant-in-Aid for Scientific Research(B) (23300005,15H02684).

Author information

Authors and Affiliations

  1. Japan Advanced Institute of Science and Technology, Nomi, Japan

    Vu Xuan Tung & Mizuhito Ogawa

  2. University of Engineering and Technology, Vietnam National University, Hanoi, Vietnam

    To Van Khanh

Authors
  1. Vu Xuan Tung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. To Van Khanh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mizuhito Ogawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vu Xuan Tung .

Editor information

Editors and Affiliations

  1. Aix-Marseille University, Marseille, France

    Nicola Olivetti

  2. SRI International, Menlo Park, California, USA

    Ashish Tiwari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Tung, V.X., Van Khanh, T., Ogawa, M. (2016). raSAT: An SMT Solver for Polynomial Constraints. In: Olivetti, N., Tiwari, A. (eds) Automated Reasoning. IJCAR 2016. Lecture Notes in Computer Science(), vol 9706. Springer, Cham. https://doi.org/10.1007/978-3-319-40229-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40229-1_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40228-4

  • Online ISBN: 978-3-319-40229-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation