DeepAI AI Chat
Log In Sign Up

Proving UNSAT in SMT: The Case of Quantifier Free Non-Linear Real Arithmetic

by   Erika Ábrahám, et al.
Coventry University
University of Bath
RWTH Aachen University
Stanford University

We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit trivial proofs and how past formalisation attempts are not sufficient. We note that the new breed of local search based algorithms for this domain may offer an easier path forward.


page 1

page 2

page 3

page 4


Local Search For SMT On Linear and Multilinear Real Arithmetic

Satisfiability Modulo Theories (SMT) has significant application in vari...

Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers

We present new methods for solving the Satisfiability Modulo Theories pr...

Non-linear Real Arithmetic Benchmarks derived from Automated Reasoning in Economics

We consider problems originating in economics that may be solved automat...

A CDCL-style calculus for solving non-linear constraints

In this paper we propose a novel approach for checking satisfiability of...

Local Search for Solving Satisfiability of Polynomial Formulas

Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) ...

SMT Solving over Finite Field Arithmetic

Non-linear polynomial systems over finite fields are used to model funct...

Verified Quadratic Virtual Substitution for Real Arithmetic

This paper presents a formally verified quantifier elimination (QE) algo...