Computing Tropical Prevarieties with Satisfiability Modulo Theory (SMT) Solvers

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

I am presenting a novel way to use SMT (Satisfiability Modulo Theory) to compute the tropical prevariety (resp. equilibrium) of a polynomial system. 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 25 or more. Furthermore, the new approach offers a way to compute at least parts of the solution if the polyhedral approach is infeasible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2020

Computing Tropical Prevarieties with Satisfiability Modulo Theories (SMT) Solvers

A novel way to use SMT (Satisfiability Modulo Theories) solvers to compu...
research
09/15/2023

Satisfiability.jl: Satisfiability Modulo Theories in Julia

Satisfiability modulo theories (SMT) is a core tool in formal verificati...
research
09/07/2021

First-Order Logic in Finite Domains: Where Semantic Evaluation Competes with SMT Solving

In this paper, we compare two alternative mechanisms for deciding the va...
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
06/08/2023

Partitioning Strategies for Distributed SMT Solving

For many users of Satisfiability Modulo Theories (SMT) solvers, the solv...
research
07/06/2021

Proof Generation in CDSAT

The main ideas in the CDSAT (Conflict-Driven Satisfiability) framework f...

Please sign up or login with your details

Forgot password? Click here to reset