Computing Tropical Prevarieties with Satisfiability Modulo Theories (SMT) Solvers

04/15/2020
by   Christoph Lüders, et al.
0

A novel way to use SMT (Satisfiability Modulo Theories) solvers to compute the tropical prevariety (resp. equilibrium) of a polynomial system is presented. The new method is benchmarked against a naive approach that uses purely polyhedral methods. It turns out that the SMT approach is faster than the polyhedral approach for models that would otherwise take more than one minute to compute, in many cases by a factor of 60 or more, and in the worst case is only slower by a factor of two. Furthermore, the new approach is an anytime algorithm, thus offering a way to compute parts of the solution when the polyhedral approach is infeasible.

READ FULL TEXT
research
04/15/2020

Computing Tropical Prevarieties with Satisfiability Modulo Theory (SMT) Solvers

I am presenting a novel way to use SMT (Satisfiability Modulo Theory) to...
research
06/08/2023

Partitioning Strategies for Distributed SMT Solving

For many users of Satisfiability Modulo Theories (SMT) solvers, the solv...
research
08/26/2019

CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories

We introduce an approach that aims to combine the usage of satisfiabilit...
research
09/03/2021

On the proof complexity of MCSAT

Satisfiability Modulo Theories (SMT) and SAT solvers are critical compon...
research
10/10/2018

Smtlink 2.0

Smtlink is an extension of ACL2 with Satisfiability Modulo Theories (SMT...
research
06/15/2023

Complete Trigger Selection in Satisfiability modulo first-order Theories

Let T be an SMT solver with no theory solvers except for Quantifier Inst...
research
08/06/2019

Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability

In this paper, we present a non-invasive reverse engineering attack base...

Please sign up or login with your details

Forgot password? Click here to reset