relation: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2975/
title: EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT
creator: Pascal, Fontain
creator: Mizuhito, Ogawa
creator: Thomas, Sturm
creator: To, Van Khanh
creator: Vu, Xuan Tung
subject: Information Technology (IT)
description: 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.
date: 2018
type: Conference or Workshop Item
type: NonPeerReviewed
identifier:   Pascal, Fontain and Mizuhito, Ogawa and Thomas, Sturm and To, Van Khanh and Vu, Xuan Tung  (2018) EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT.  In: Satisfiability Checking and Symbolic Computation, 11 July 2018, United Kingdom.