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

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.

automated reasoning

Conflict resolution

theorem proving

Arithmetic reasoning

Linear arithmetic

formal methods

Bound propagation method

Linear real arithmetic

Författare

I. Dragan

Technische Universität Wien

Konstantin Korovin

University of Manchester

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

Andrei Voronkov

University of Manchester

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, September 23-26, 2013, Timisoara, Romania. Nikolaj Bjorner (editors), IEEE series

Vol. 2013 169-176 6821147

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

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Data- och informationsvetenskap

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1109/SYNASC.2013.30

Mer information

Senast uppdaterat

2019-11-04