Abstract Satisfiability Modulo Linear Integer Arithmetic, SMT (LIA) for short, has significant
applications in many domains. In this paper, we develop the first local search algorithm for …

Abstract Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT (NRA) for short,
concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean …

Abstract Satisfiability Modulo Theories (SMT) is essential for many practical applications, eg,
in hard-and software verification, and increasingly also in other scientific areas like …

Modeling problems containing a mixture of Boolean and numerical variables is a long-
standing interest of Artificial Intelligence. However, performing inference and learning in …

Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a
formula with respect to certain background first-order theories. In this article, we focus on …

Satisfiability Modulo Theories (SMT) has significant application in various domains. In this
paper, we focus on quantifier-free Satisfiablity Modulo Real Arithmetic, referred to as SMT …

Many applications of computer-aided verification require bit-precise reasoning as provided
by satisfiability modulo theories (SMT) solvers for the theory of quantifier-free fixed-size bit …

Local search has recently been applied to SMT problems over various arithmetic theories.
Among these, nonlinear real arithmetic poses special challenges due to its uncountable …

Current state of the art for reasoning about quantifier-free bit-vector constraints in
Satisfiability Modulo Theories (SMT) is a technique called bit-blasting, an eager translation …

Improving Local Search for Bit-Vector Logics in SMT with Path Propagation Page 1
Improving Local Search for Bit-Vector Logics in SMT with Path Propagation Aina Niemetz …