We present a new algorithm for determining the satisfiability of conjunctions of non-linear
polynomial constraints over the reals, which can be used as a theory solver for satisfiability …

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-
order formula with respect to some theory or combination of theories; Verification Modulo …

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 …

The cvc5 SMT solver solves quantifier-free nonlinear real arithmetic problems by combining
the cylindrical algebraic coverings method with incremental linearization in an abstraction …

Isabelle is a generic theorem prover with a fragment of higherorder logic as a metalogic for
defining object logics. Isabelle also provides proof terms. We formalize this metalogic and …

A wide range of problems from aerospace engineering and other application areas can be
encoded logically and solved using satisfiability modulo theories (SMT) tools, which …

One of the few available complete methods for checking the satisfiability of sets of
polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In …

We consider problems originating in economics that may be solved automatically using
mathematical software. We present and make freely available a new benchmark set of such …

Incremental linearization is a conceptually simple, yet effective, technique that we have
recently proposed for solving SMT problems on the theories of non-linear arithmetic over the …

ksmt is a CDCL-style calculus for solving non-linear constraints over the real numbers
involving polynomials and transcendental functions. In this paper we investigate properties …