학술논문

Bound Propagation for Arithmetic Reasoning in Vampire
Document Type
Conference
Source
2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2013 15th International Symposium on. :169-176 Sep, 2013
Subject
Computing and Processing
Upper bound
Cognition
Input variables
Algorithm design and analysis
Educational institutions
Benchmark testing
Libraries
linear real arithmetic
bound propagation method
conflict resolution
arithmetic reasoning
linear arithmetic
Language
Abstract
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.