Pages that link to "Item:Q3140556"
From MaRDI portal
The following pages link to Applying Linear Quantifier Elimination (Q3140556):
Displaying 50 items.
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Linear quantifier elimination (Q707743) (← links)
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Better answers to real questions (Q898260) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination (Q945005) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Combining logical and algebraic techniques for natural style proving in elementary analysis (Q1025313) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields (Q1184352) (← links)
- Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach (Q1306036) (← links)
- Discussion on: ``Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach'' by D. Nešić and I. M. Y. Mareels (Q1306037) (← links)
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. (Q1568438) (← links)
- Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition (Q1581134) (← links)
- Linear problems in valued fields (Q1582303) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← links)
- Symbolic model checking of timed guarded commands using difference decision diagrams (Q1858438) (← links)
- Fast theorem-proving and Wu's method (Q1966111) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- On solving quantified bit-vector constraints using invertibility conditions (Q2050109) (← links)
- Survey on mining signal temporal logic specifications (Q2105443) (← links)
- Syntax-guided quantifier instantiation (Q2233503) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Out of order quantifier elimination for standard quantified linear programs (Q2456614) (← links)
- Cylindrical algebraic decomposition using validated numerics (Q2457384) (← links)
- Quantifier elimination in automatic loop parallelization (Q2457396) (← links)
- Multiple object semilinear motion planning (Q2457425) (← links)
- On a decision procedure for quantified linear programs (Q2462634) (← links)
- A decision procedure for linear ``big O'' equations (Q2642465) (← links)
- (Q2760201) (← links)
- A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
- Applied Algebraic Geometry in Model Based Design for Manufacturing (Q3455008) (← links)
- Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space (Q3510811) (← links)
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (Q3540195) (← links)
- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (Q3617770) (← links)
- Towards incorporating background theories into quantifier elimination (Q3643319) (← links)
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity (Q3644100) (← links)
- Classical numerical methods in engineering: a note on existential quantifier elimination under parametric inequality constraints (Q4213662) (← links)
- Derivation of feasibility conditions in engineering problems under parametric inequality constraints with classical Fourier elimination (Q4506060) (← links)
