English
Related papers

Related papers: Computing Tropical Prevarieties with Satisfiabilit…

200 papers

Inspired by numerical homotopy methods we propose a combinatorial homotopy algorithm for finding all isolated solutions to a tropical polynomial systems of n tropical polynomials in n variables. In particular, a tropicalisation of the…

Combinatorics · Mathematics 2016-01-13 Anders Nedergaard Jensen

We study SMT problems over the reals containing ordinary differential equations. They are important for formal verification of realistic hybrid systems and embedded software. We develop delta-complete algorithms for SMT formulas that are…

Logic in Computer Science · Computer Science 2013-10-31 Sicun Gao , Soonho Kong , Edmund Clarke

We apply methods of tropical optimization to handle problems of rating alternatives on the basis of the log-Chebyshev approximation of pairwise comparison matrices. We derive a direct solution in a closed form, and investigate the obtained…

Optimization and Control · Mathematics 2017-08-15 Nikolai Krivulin

The number of positive solutions of a system of two polynomials in two variables defined in the field of real numbers with a total of five distinct monomials cannot exceed 15. All previously known examples have at most 5 positive solutions.…

Algebraic Geometry · Mathematics 2017-03-08 Boulos El Hilany

We apply methods and techniques of tropical optimization to develop a new theoretical and computational framework for the implementation of the Analytic Hierarchy Process in multi-criteria problems of rating alternatives from pairwise…

Optimization and Control · Mathematics 2022-07-11 Nikolai Krivulin , Sergei Sergeev

This paper investigates one-step backward reachability for uncertain max-plus linear systems with additive disturbances. Given a target set, the problem is to compute the set of states from which there exists an admissible control input…

Systems and Control · Electrical Eng. & Systems 2026-03-31 Yuda Li , Xiang Yin

Given a formula $F$ of satisfiability modulo theory (SMT), the classical SMT solver tries to (1) abstract $F$ as a Boolean formula $F_B$, (2) find a Boolean solution to $F_B$, and (3) check whether the Boolean solution is consistent with…

Logic in Computer Science · Computer Science 2023-03-17 Shang-Wei Lin , Si-Han Chen , Tzu-Fan Wang , Yean-Ru Chen

This short paper proposes to learn models of satisfiability modulo theories (SMT) formulas during solving. Specifically, we focus on infinite models for problems in the logic of linear arithmetic with uninterpreted functions (UFLIA). The…

Logic in Computer Science · Computer Science 2025-03-24 Mikoláš Janota , Bartosz Piotrowski , Karel Chvalovský

Tropical mathematics redefines the rules of arithmetic by replacing addition with taking a maximum, and by replacing multiplication with addition. After briefly discussing a tropical version of linear algebra, we study polynomials build…

Algebraic Geometry · Mathematics 2019-08-21 Ralph Morrison

We present a new model-based interpolation procedure for satisfiability modulo theories (SMT). The procedure uses a new mode of interaction with the SMT solver that we call solving modulo a model. This either extends a given partial model…

Logic in Computer Science · Computer Science 2021-06-09 Dejan Jovanović , Bruno Dutertre

SMT solvers have been used successfully as reasoning engines for automated verification and other applications based on automated reasoning. Current techniques for dealing with quantified formulas in SMT are generally incomplete, forcing…

Logic in Computer Science · Computer Science 2017-06-02 Andrew Reynolds , Cesare Tinelli , Clark Barrett

The tropical arithmetic operations on $\mathbb{R}$ are defined by $a\oplus b=\min\{a,b\}$ and $a\otimes b=a+b$. Let $A$ be a tropical matrix and $k$ a positive integer, the problem of Tropical Matrix Factorization (TMF) asks whether there…

Combinatorics · Mathematics 2013-07-26 Yaroslav Shitov

Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automating verification problems. A limitation frequently…

Logic in Computer Science · Computer Science 2015-08-28 Kshitij Bansal , Andrew Reynolds , Tim King , Clark Barrett , Thomas Wies

Optimization Modulo Theories (OMT) has emerged as an important extension of the highly successful Satisfiability Modulo Theories (SMT) paradigm. The OMT problem requires solving an SMT problem with the restriction that the solution must be…

Logic in Computer Science · Computer Science 2024-04-30 Nestan Tsiskaridze , Clark Barrett , Cesare Tinelli

The tropical semiring is an algebraic system with addition ``$\max$'' and multiplication ``$+$''. As well as in conventional algebra, linear programming in the tropical semiring has been developed. In this study, we introduce a new type of…

Optimization and Control · Mathematics 2026-02-03 Yuki Nishida

Tropical semiring has proven successful in several research areas, including optimal control, bioinformatics, discrete event systems, or solving a decision problem. In previous studies, a matrix two-factorization algorithm based on the…

Machine Learning · Computer Science 2024-01-17 Amra Omanović , Polona Oblak , Tomaž Curk

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante

Matrix Factorization (MF) has found numerous applications in Machine Learning and Data Mining, including collaborative filtering recommendation systems, dimensionality reduction, data visualization, and community detection. Motivated by the…

Machine Learning · Computer Science 2023-09-26 Ioannis Kordonis , Emmanouil Theodosis , George Retsinas , Petros Maragos

Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean combinations of polynomial equations and inequalities with integer…

Logic in Computer Science · Computer Science 2023-03-22 Haokun Li , Bican Xia , Tianqi Zhao

We present a novel approach for solving quantified bit-vector formulas in Satisfiability Modulo Theories (SMT) based on computing symbolic inverses of bit-vector operators. We derive conditions that precisely characterize when bit-vector…

Logic in Computer Science · Computer Science 2018-05-15 Aina Niemetz , Mathias Preiner , Andrew Reynolds , Clark Barrett , Cesare Tinelli