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.
This is the latest version of this item.
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Information Technology (IT) |
| Divisions: | Faculty of Information Technology (FIT) |
| Depositing User: | Khánh Tô Văn |
| Date Deposited: | 08 Jun 2018 08:55 |
| Last Modified: | 10 Jun 2018 08:06 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/2975 |
Available Versions of this Item
- EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. (deposited 08 Jun 2018 08:55) [Currently Displayed]
Actions (login required)
 |
View Item |
