Bound Propagation for Arithmetic Reasoning in Vampire
Paper i proceeding, 2013

This paper describes an implementation and experimental evaluation of a recently introduced bound propagation method for solving systems of linear inequalities over the reals and rationals. The implementation is part of the first-order theorem prover Vampire. The input problems are systems of linear inequalities over reals or rationals. Their satisfiability is checked by assigning values to the variables of the system and propagating the bounds on these variables. To make the method efficient, we use various strategies for representing numbers, selecting variable orderings, choosing variable values and propagating bounds. We evaluate our implementation on a large number of examples and compare it with state-of-the-art SMT solvers.

Conflict resolution

Linear real arithmetic

Arithmetic reasoning

Bound propagation method

Linear arithmetic

automated reasoning

theorem proving

formal methods


I. Dragan

Technische Universität Wien

Konstantin Korovin

University of Manchester

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

Andrei Voronkov

University of Manchester

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

Vol. 2013 169-176 6821147
978-147993035-7 (ISBN)

15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC
Timisoara, Romania,


Informations- och kommunikationsteknik


Data- och informationsvetenskap


Datavetenskap (datalogi)



Mer information

Senast uppdaterat