A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
From MaRDI portal
Publication:1701667
DOI10.1007/s11786-017-0319-zzbMath1425.68380OpenAlexW2608023254WikidataQ59529055 ScholiaQ59529055MaRDI QIDQ1701667
Publication date: 27 February 2018
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-017-0319-z
verificationstability analysissatisfiabilityreaction systemsreal geometryvirtual substitutionreal quantifier elimination and decisionsubtropical methods
Symbolic computation and algebraic computation (68W30) Classical flows, reactions, etc. in chemistry (92E20) Real algebraic sets (14P05) Cell biology (92C37) Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Parametric toricity of steady state varieties of reaction networks, Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom?, Automated exploration of envelopes and offsets with networking of technologies, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, Identifying the parametric occurrence of multiple steady states for some biological networks, Efficiently and effectively recognizing toricity of steady state varieties, A logic based approach to finding real singularities of implicit ordinary differential equations, Algorithmic reduction of biological networks with multiple time scales, Editorial: Symbolic computation and satisfiability checking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
- Algorithmic global criteria for excluding oscillations
- Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Some remarks on Hilbert's Nullstellensatz
- Lectures on formally real fields
- Better answers to real questions
- Algebraic approaches to stability analysis of biological systems
- Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models
- On the application of Buchberger's algorithm to automated geometry theorem proving
- Using Gröbner bases to reason about geometry problems
- Basic principles of mechanical theorem proving in elementary geometries
- The complexity of linear problems in fields
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Real quantifier elimination is doubly exponential
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination
- Partial cylindrical algebraic decomposition for quantifier elimination
- Complexity of deciding Tarski algebra
- A new approach for automatic theorem proving in real geometry
- Criterion of Hopf bifurcations without using eigenvalues
- An elimination method for polynomial systems
- Testing stability by quantifier elimination
- Simplification of quantifier-free formulae over ordered fields
- Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
- Constructing a single cell in cylindrical algebraic decomposition
- Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems
- Mathematical model of the cell division cycle of fission yeast
- Subtropical Real Root Finding
- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
- Applying Linear Quantifier Elimination
- Efficient Preprocessing Methods for Quantifier Elimination
- New Domains for Applied Quantifier Elimination
- Constraint-Based Approach for Analysis of Hybrid Systems
- Applying a Rigorous Quasi-Steady State Approximation Method for Proving the Absence of Oscillations in Models of Genetic Circuits
- Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
- On the combinatorial and algebraic complexity of quantifier elimination
- QEPCAD B
- Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
- Mechanically proving geometry theorems using a combination of Wu's method and Collins' method
- Verification and synthesis using real quantifier elimination
- A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
- On Proving the Absence of Oscillations in Models of Genetic Circuits
- On k-constructable sets, k-elementary formulae, and elimination theory.
- Atomic and molecular calculations using quasirandom numbers
