AI Chat AI Image Generator AI Video Text to Speech

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

08/11/2021

∙

by Erika Ábrahám, et al.

∙

∙

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.

Erika Ábrahám
15 publications
James H. Davenport
20 publications
Matthew England
37 publications
Gereon Kremer
4 publications

page 1

page 2

page 3

page 4

research

∙ 03/12/2023

Local Search For SMT On Linear and Multilinear Real Arithmetic

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

0 Bohan Li, et al. ∙

research

∙ 07/31/2023

SMT-Solving Induction Proofs of Inequalities

This paper accompanies a new dataset of non-linear real arithmetic probl...

0 Ali K. Uncu, et al. ∙

research

∙ 08/31/2020

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

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

0 Cristina Borralleras, et al. ∙

research

∙ 06/28/2018

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

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

0 C. Mulligan, et al. ∙

research

∙ 05/22/2019

A CDCL-style calculus for solving non-linear constraints

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

0 Franz Brauße, et al. ∙

research

∙ 05/29/2021

Verified Quadratic Virtual Substitution for Real Arithmetic

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

0 Matias Scharager, et al. ∙