eprintid: 2975
rev_number: 6
eprint_status: archive
userid: 329
dir: disk0/00/00/29/75
datestamp: 2018-06-08 08:55:03
lastmod: 2018-06-10 08:06:21
status_changed: 2018-06-08 08:55:03
type: conference_item
succeeds: 2953
metadata_visibility: show
creators_name: Pascal, Fontain
creators_name: Mizuhito, Ogawa
creators_name: Thomas, Sturm
creators_name: To, Van Khanh
creators_name: Vu, Xuan Tung
creators_id: khanhtv@vnu.edu.vn
title: EA: Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT
ispublished: pub
subjects: IT
divisions: fac_fit
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.
date: 2018
date_type: published
full_text_status: none
pres_type: paper
event_title: Satisfiability Checking and Symbolic Computation
event_location: United Kingdom
event_dates: 11 July 2018
event_type: workshop
refereed: FALSE
citation:   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.