Linear Quantifier Elimination
From MaRDI portal
Recommendations
Cited in
(27)- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- FMplex: exploring a bridge between Fourier-Motzkin and simplex
- Advances in Databases and Information Systems
- Formalizing the Logic-Automaton Connection
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- Real World Verification
- scientific article; zbMATH DE number 68156 (Why is no real title available?)
- Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic
- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors
- Proof synthesis and reflection for linear arithmetic
- A verified decision procedure for orders in Isabelle/HOL
- Head linear reduction and pure proof net extraction
- Applying Linear Quantifier Elimination
- SMT solving for functional programming over infinite structures
- A layered algorithm for quantifier elimination from linear modular constraints
- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
- Solving quantified linear arithmetic by counterexample-guided instantiation
- Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
- Verifying an incremental theory solver for linear arithmetic in Isabelle/HOL
- Weak quantifier elimination for the full linear theory of the integers
- Str\(\dotplus\)ve and integers
- A Quantifier Elimination Algorithm for Linear Real Arithmetic
- Eliminating disjunctions by disjunction elimination
- Linear quantifier elimination as an abstract decision procedure
- An incremental algorithm for DLO quantifier elimination via constraint propagation
- Linear quantifier elimination
- FMplex: a novel method for solving linear real arithmetic problems
This page was built for publication: Linear Quantifier Elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541684)
