Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT

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.
Type de document :
Communication dans un congrès
SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom
Liste complète des métadonnées

https://hal.inria.fr/hal-01946733
Contributeur : Pascal Fontaine <>
Soumis le : jeudi 6 décembre 2018 - 12:35:39
Dernière modification le : mardi 18 décembre 2018 - 16:38:25

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01946733, version 1

Collections

Citation

Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Van Khanh To, Xuan Tung Vu. Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. SC-square 2018 - Third International Workshop on Satisfiability Checking and Symbolic Computation, Jul 2018, Oxford, United Kingdom. 〈hal-01946733〉

Partager

Métriques

Consultations de la notice

18

Téléchargements de fichiers

71