TY  - CONF
ID  - SisLab2975
UR  - https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2975/
A1  - Pascal, Fontain
A1  - Mizuhito, Ogawa
A1  - Thomas, Sturm
A1  - To, Van Khanh
A1  - Vu, Xuan Tung
Y1  - 2018///
N2  - 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.
TI  - EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT
M2  - United Kingdom
AV  - none
T2  - Satisfiability Checking and Symbolic Computation
ER  -