On Fourier's algorithm for linear arithmetic constraints
From MaRDI portal
Publication:688575
DOI10.1007/BF00245296zbMATH Open0781.90064OpenAlexW2000600476MaRDI QIDQ688575FDOQ688575
Authors: Jean-Louis Lassez, Michael J. Maher
Publication date: 17 February 1994
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00245296
Recommendations
Cites Work
Cited In (16)
- Projecting CLP(\({\mathcal R}\)) constraints
- Incorporating decision procedures in implicit induction.
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
- Learning strategies for mechanised building of decision procedures
- Constraint contextual rewriting.
- From LP to LP: Programming with constraints
- Practical issues on the projection of polyhedral sets
- Optimal length resolution refutations of difference constraint systems
- Programming in metric temporal logic
- Fourier algorithm revisited
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Fourier's Method of Linear Programming and Its Dual
- On a decision procedure for quantified linear programs
- Data structures with arithmetic constraints: A non-disjoint combination
- Variable Elimination in Linear Constraints
- A linear programming primer: from Fourier to Karmarkar
This page was built for publication: On Fourier's algorithm for linear arithmetic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688575)