AAAI Publications, Eighth Symposium on Abstraction, Reformulation, and Approximation

Font Size: 
Tightened Transitive Closure of Integer Addition Constraints
Peter Revesz

Last modified: 2009-10-22

Abstract


We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ± x ± yd and bound constraints of the form ± xd where x and y are integer variables and d is an integer constrant. The running time of these algorithms is a cubic polynomial in the number of input constraints. We also describe an efficient matrix representation of addition and bound constraints. The matrix representation provides a easy, algebraic implementation of the satisfiability and tightened transitive closure algorithms. We also outline the use of these algorithms for the improved implementation of abstract interpretation methods based on the octagonal abstract domain.

Full Text: PDF