A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic

@inproceedings{Bobot2012ASE,
  title={A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic},
  author={François Bobot and Sylvain Conchon and Evelyne Contejean and Mohamed Iguernelala and A. Mahboubi and Alain Mebsout and G. Melquiond},
  booktitle={IJCAR},
  year={2012}
}
This paper describes a novel decision procedure for quantifier-free linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domain and then proceed either by projection (e.g.Omega-Test) or by branching/cutting methods (branch-and-bound, branch-and-cut, Gomory cuts). Our approach tries to bridge the gap between the two techniques: it interleaves an exhaustive search for a model with bounds inference. These bounds are computed provided an oracle capable of… Expand
A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems
New techniques for linear arithmetic: cubes and equalities
A Collaborative Framework for Non-Linear Integer Arithmetic Reasoning in Alt-Ergo
Fast Cube Tests for LIA Constraint Solving
Building Bridges between Symbolic Computation and Satisfiability Checking
From Resolution and DPLL to Solving Arithmetic Constraints
Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers
Cutting the Mix
Leveraging linear and mixed integer programming for SMT
...
1
2
3
...

References

SHOWING 1-10 OF 24 REFERENCES
A Practical Approach to Satisability Modulo Linear Integer Arithmetic
  • A. Griggio
  • Mathematics, Computer Science
  • J. Satisf. Boolean Model. Comput.
  • 2012
Decision Procedures - An Algorithmic Point of View
The Omega test: A fast and practical integer programming algorithm for dependence analysis
  • W. Pugh
  • Computer Science
  • Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91)
  • 1991
Theory of linear and integer programming
  • A. Schrijver
  • Mathematics, Computer Science
  • Wiley-Interscience series in discrete mathematics and optimization
  • 1999
Z3: An Efficient SMT Solver
Cutting to the Chase Solving Linear Integer Arithmetic
Dependence analysis for supercomputing
  • U. Banerjee
  • Mathematics, Computer Science
  • The Kluwer international series in engineering and computer science
  • 1988
...
1
2
3
...