FMplex: a novel method for solving linear real arithmetic problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 1240224 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- scientific article; zbMATH DE number 3022422 (Why is no real title available?)
- Applying Linear Quantifier Elimination
- Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure
- Complexity estimates for Fourier-Motzkin elimination
- Conflict Resolution
- Extending the fundamental theorem of linear programming for strict inequalities
- FMplex: a novel method for solving linear real arithmetic problems
- Generalizing DPLL to Richer Logics
- Linear Quantifier Elimination
- Natural domain SMT: a preliminary assessment
- Polynomial algorithms in linear programming
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Solving systems of linear inequalities by bound propagation
- Splitting on Demand in SAT Modulo Theories
- Towards conflict-driven learning for virtual substitution
- Virtual substitution for SMT-solving
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
Cited in
(4)
This page was built for publication: FMplex: a novel method for solving linear real arithmetic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940547)
