On Fourier's algorithm for linear arithmetic constraints

DOI10.1007/BF00245296zbMath0781.90064OpenAlexW2000600476MaRDI QIDQ688575

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

zbMATH Keywords

affine hull of the polyhedral setFourier's algorithmimplicit equality

Mathematics Subject Classification ID

Related Items (13)

Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Practical issues on the projection of polyhedral sets ⋮ A linear programming primer: from Fourier to Karmarkar ⋮ Programming in metric temporal logic ⋮ From LP to LP: Programming with constraints ⋮ Incorporating decision procedures in implicit induction. ⋮ Constraint contextual rewriting. ⋮ On a decision procedure for quantified linear programs ⋮ Projecting CLP(\({\mathcal R}\)) constraints ⋮ Learning Strategies for Mechanised Building of Decision Procedures ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems ⋮ Data Structures with Arithmetic Constraints: A Non-disjoint Combination

Cites Work

• Unnamed Item
• Minimal representation of convex polyhedral sets
• A canonical form for generalized linear constraints
• Fourier-Motzkin elimination and its dual
• Fourier's Method of Linear Programming and Its Dual

This page was built for publication: On Fourier's algorithm for linear arithmetic constraints