A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

Martin Bromberger 1, 2
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est, MPII - Max-Planck-Institut für Informatik
Abstract : We present a combination of the Mixed-Echelon-Hermite transformation and the Double-Bounded Reduction for systems of linear mixed arithmetic that preserve satisfiability and can be computed in polynomial time. Together, the two transformations turn any system of linear mixed constraints into a bounded system, i.e., a system for which termination can be achieved easily. Existing approaches for linear mixed arithmetic, e.g., branch-and-bound and cuts from proofs, only explore a finite search space after application of our two transformations. Instead of generating a priori bounds for the variables, e.g., as suggested by Papadimitriou, unbounded variables are eliminated through the two transformations. The transformations orient themselves on the structure of an input system instead of computing a priori (over- )approximations out of the available constants. Experiments provide further evidence to the efficiency of the transformations in practice. We also present a polynomial method for converting certificates of (un)satisfiability from the transformed to the original system.
Document type :
Conference papers
Liste complète des métadonnées

Contributor : Stephan Merz <>
Submitted on : Monday, December 3, 2018 - 9:27:04 AM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM
Document(s) archivé(s) le : Monday, March 4, 2019 - 1:13:39 PM


Files produced by the author(s)


  • HAL Id : hal-01942228, version 1



Martin Bromberger. A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems. IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. pp.329-345. ⟨hal-01942228⟩



Record views


Files downloads