%0 Conference Paper
%A Pascal, Fontain
%A Mizuhito, Ogawa
%A Thomas, Sturm
%A To, Van Khanh
%A Vu, Xuan Tung
%B Satisfiability Checking and Symbolic Computation
%C United Kingdom
%D 2018
%F SisLab:2975
%T EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2975/
%X We report on a prototypical tool for Satisfiability Modulo Theory solving for quantifier-free formulas in Non-linear Real Arithmetic or, more precisely,real closed fields, which uses a computer algebra system as the main component. This is complemented with two heuristic techniques, also stemming from computer algebra, viz. interval constraint propagation and subtropical satisfiability. Our key idea is to make optimal use of existing knowledge and work in the symbolic computation community, reusing available methods and implementations  to the most possible extent. Experimental results show that our approach is surprisingly efficient in practice.