FMplex: A Novel Method for Solving Linear Real Arithmetic Problems (Extended Version)

09/06/2023
by   Jasper Nalbach, et al.
0

In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the worst-case complexity from doubly to singly exponential. The adaption of the procedure for SMT solving has strong correspondence to the simplex algorithm, therefore we name it FMplex. Besides the theoretical foundations, we provide an experimental evaluation in the context of SMT solving.

READ FULL TEXT
research
04/26/2020

Monadic Decomposition in Integer Linear Arithmetic (Technical Report)

Monadic decomposability is a notion of variable independence, which asks...
research
03/08/2021

Presburger arithmetic with threshold counting quantifiers is easy

We give a quantifier elimination procedures for the extension of Presbur...
research
06/25/2018

Quantifier Elimination for Database Driven Verification

Running verification tasks in database driven systems requires solving q...
research
11/05/2018

Complexity Estimates for Fourier-Motzkin Elimination

In this paper, we propose a new method for removing all the redundant in...
research
06/16/2023

Fast Approximations of Quantifier Elimination

Quantifier elimination (qelim) is used in many automated reasoning tasks...
research
07/17/2019

Solving Systems of Linear Inequalities

Dantzig and Eaves claimed that fundamental duality theorems of linear pr...
research
05/29/2021

Verified Quadratic Virtual Substitution for Real Arithmetic

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

Please sign up or login with your details

Forgot password? Click here to reset