scientific article; zbMATH DE number 1302474
From MaRDI portal
Publication:4247790
zbMath0934.68130MaRDI QIDQ4247790
Volker Weispfenning, Thomas Sturm, Andreas Dolzmann
Publication date: 31 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gröbner basisquantifier eliminationpolynomial rootscylindrical decompositionREDLOGvirtual substitution of test terms
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (28)
Parametric toricity of steady state varieties of reaction networks ⋮ On generalizing Descartes' rule of signs to hypersurfaces ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ On the complexity of quantified linear systems ⋮ Extending a Resolution Prover for Inequalities on Elementary Functions ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ Better answers to real questions ⋮ Computing with Tarski formulas and semi-algebraic sets in a web browser ⋮ On solving parametric polynomial systems ⋮ Quantifier-free encoding of invariants for hybrid systems ⋮ Timed Basic Parallel Processes ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Proving inequalities and solving global optimization problems via simplified CAD projection ⋮ Weak quantifier elimination for the full linear theory of the integers ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ On quantified linear implications ⋮ Algorithmic global criteria for excluding oscillations ⋮ MetiTarski: An automatic theorem prover for real-valued special functions ⋮ Cylindrical algebraic decomposition using local projections ⋮ Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems ⋮ Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems ⋮ Algorithmic reduction of biological networks with multiple time scales ⋮ Virtual Substitution for SMT-Solving ⋮ Combining logical and algebraic techniques for natural style proving in elementary analysis ⋮ Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition ⋮ Linear problems in valued fields ⋮ MetiTarski: An Automatic Prover for the Elementary Functions ⋮ Combining Isabelle and QEPCAD-B in the Prover’s Palette
Uses Software
This page was built for publication:
