A simplex-based extension of Fourier-Motzkin for solving linear integer arithmetic
From MaRDI portal
Recommendations
- Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
- Linear quantifier elimination as an abstract decision procedure
- Cutting to the chase. Solving linear integer arithmetic
Cited in
(11)- Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
- Integrating simplex with tableaux
- Cuts from proofs: a complete and practical technique for solving linear inequalities over integers
- A Benders decomposition approach to deciding modular linear integer arithmetic
- New techniques for linear arithmetic: cubes and equalities
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL
- Fast cube tests for LIA constraint solving
- On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
- scientific article; zbMATH DE number 1956605 (Why is no real title available?)
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
This page was built for publication: A simplex-based extension of Fourier-Motzkin for solving linear integer arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908479)