On Fourier's algorithm for linear arithmetic constraints
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Fourier algorithm revisited
- From LP to LP: Programming with constraints
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
- Learning strategies for mechanised building of decision procedures
- Practical issues on the projection of polyhedral sets
- A linear programming primer: from Fourier to Karmarkar
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Data structures with arithmetic constraints: A non-disjoint combination
- Projecting CLP(\({\mathcal R}\)) constraints
- Optimal length resolution refutations of difference constraint systems
- Programming in metric temporal logic
- Variable Elimination in Linear Constraints
- Incorporating decision procedures in implicit induction.
- Fourier's Method of Linear Programming and Its Dual
- Constraint contextual rewriting.
- On a decision procedure for quantified linear programs
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)