QEPCAD B
From MaRDI portal
Publication:4810199
DOI10.1145/968708.968710zbMath1083.68148OpenAlexW2026612342MaRDI QIDQ4810199
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/968708.968710
Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (67)
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Heuristics for exact nonnegative matrix factorization ⋮ Parametric toricity of steady state varieties of reaction networks ⋮ Automatic computation of the complete root classification for a parametric polynomial ⋮ Recent Advances in Real Geometric Reasoning ⋮ Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) ⋮ An SOS-QE approach to nonlinear gain analysis for polynomial dynamical systems ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ On the complexity of quantified linear systems ⋮ Formal Modelling, Analysis and Verification of Hybrid Systems ⋮ On invariant checking ⋮ Extending a Resolution Prover for Inequalities on Elementary Functions ⋮ Exact safety verification of hybrid systems using sums-of-squares representation ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Dominance in the family of Sugeno-Weber t-norms ⋮ Variant quantifier elimination ⋮ Adapting Real Quantifier Elimination Methods for Conflict Set Computation ⋮ A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications ⋮ Applications of real number theorem proving in PVS ⋮ Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL ⋮ Cylindrical algebraic sub-decompositions ⋮ Global optimization of polynomials over real algebraic sets ⋮ Quantifier elimination for a class of exponential polynomial formulas ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ A systematic approach for doing an a priori identifiability study of dynamical nonlinear models ⋮ Quantifier elimination supported proofs in the numerical treatment of fluid flows ⋮ Hybrid Automata in Systems Biology: How Far Can We Go? ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ Polynomial bivariate copulas of degree five: characterization and some particular inequalities ⋮ Automatic generation of bounds for polynomial systems with application to the Lorenz system ⋮ A local Fourier convergence analysis of a multigrid method using symbolic computation ⋮ Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition ⋮ On quantified linear implications ⋮ Integrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Proverʼs Palette ⋮ Hybrid automata, reachability, and systems biology ⋮ Multistationarity in the space of total concentrations for systems that admit a monomial parametrization ⋮ Parametric optimization and optimal control using algebraic geometry methods ⋮ Using machine learning to improve cylindrical algebraic decomposition ⋮ MetiTarski: An automatic theorem prover for real-valued special functions ⋮ Real World Verification ⋮ On the algebraic boundaries among typical ranks for real binary forms ⋮ Identifying the parametric occurrence of multiple steady states for some biological networks ⋮ An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions ⋮ Truth table invariant cylindrical algebraic decomposition ⋮ Cylindrical algebraic decomposition using local projections ⋮ Periodically Controlled Hybrid Systems ⋮ The impact on the properties of the EFGM copulas when extending this family ⋮ Algorithmic reduction of biological networks with multiple time scales ⋮ $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation ⋮ On the Feasibility of Semi-algebraic Sets in Poisson Regression ⋮ Virtual Substitution for SMT-Solving ⋮ QEPCAD ⋮ Combined Decision Techniques for the Existential Theory of the Reals ⋮ Fully incremental cylindrical algebraic decomposition ⋮ Cylindrical algebraic decomposition with equational constraints ⋮ Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem ⋮ Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms ⋮ Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems ⋮ Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition ⋮ Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants ⋮ MetiTarski: An Automatic Prover for the Elementary Functions ⋮ Combining Isabelle and QEPCAD-B in the Prover’s Palette ⋮ The (B) Conjecture for Uniform Measures in the Plane ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ A comparison of algorithms for proving positivity of linearly recurrent sequences ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares ⋮ A hypergeometric inequality
Uses Software
This page was built for publication: QEPCAD B
