Date of Original Version

7-2002

Type

Conference Proceeding

Abstract or Description

We show a reduction to propositional logic from a Boolean combination of inequalities of the form v i ≥ v j + c and v i > v j + c, where c is a constant and v i, v j are variables of type real or integer. Equalities and uninterpreted functions can be expressed in this logic as well. We discuss the advantages of using this reduction as compared to competing methods, and present experimental results that support our claims.

DOI

10.1007/3-540-45657-0

Share

COinS