On Fourier's algorithm for linear arithmetic constraints

DOI10.1007/BF00245296MaRDI QIDQ688575zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

affine hull of the polyhedral setFourier's algorithmimplicit equality

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Fourier algorithm revisited
• Fourier's Method of Linear Programming and Its Dual
• Variable Elimination in Linear Constraints
• Solution of parametrized linear inequalities by Fourier elimination and its applications
• scientific article; zbMATH DE number 1182798

Cites work

• A canonical form for generalized linear constraints
• Fourier-Motzkin elimination and its dual
• Fourier's Method of Linear Programming and Its Dual
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Minimal representation of convex polyhedral sets

Cited in

(19)

• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• Programming in metric temporal logic
• Practical issues on the projection of polyhedral sets
• Incorporating decision procedures in implicit induction.
• Constraint contextual rewriting.
• A linear programming primer: from Fourier to Karmarkar
• On a decision procedure for quantified linear programs
• Variable Elimination in Linear Constraints
• Data structures with arithmetic constraints: A non-disjoint combination
• Fourier's Method of Linear Programming and Its Dual
• Learning strategies for mechanised building of decision procedures
• Fourier algorithm revisited
• From LP to LP: Programming with constraints
• Projecting CLP(\({\mathcal R}\)) constraints
• The CDSAT method for satisfiability modulo theories and assignment: an exposition
• The QSMA algorithm for quantifiers in SMT
• Efficient detection of redundancies in systems of linear inequalities
• Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
• Optimal length resolution refutations of difference constraint systems

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)