REDLOG

swMATH4250MaRDI QIDQ16433FDOQ16433

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Superposition Modulo Non-linear Arithmetic
• Parametric quantified SAT solving
• Multiphase until formulas over Markov reward models: an algebraic approach
• Parametric toricity of steady state varieties of reaction networks
• Symbol elimination and applications to parametric entailment problems
• Better answers to real questions
• $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
• Building bridges between symbolic computation and satisfiability checking
• The Gröbner cover
• A multi-criteria computer package for power transformer fault detection and diagnosis
• Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
• Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks
• Efficient Preprocessing Methods for Quantifier Elimination
• Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
• A logic based approach to finding real singularities of implicit ordinary differential equations
• Automatic generation of bounds for polynomial systems with application to the Lorenz system
• Applied Algebraic Geometry in Model Based Design for Manufacturing
• Efficiently and effectively recognizing toricity of steady state varieties
• Algorithmic reduction of biological networks with multiple time scales
• A geometric method for model reduction of biochemical networks with polynomial rate functions
• Adapting Real Quantifier Elimination Methods for Conflict Set Computation
• On the Implementation of CGS Real QE
• Virtual Substitution for SMT-Solving
• Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation)
• Hierarchical Reasoning for the Verification of Parametric Systems
• A linear programming relaxation based approach for generating barrier certificates of hybrid systems
• Identifying the parametric occurrence of multiple steady states for some biological networks
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
• On invariant synthesis for parametric systems
• Title not available (Why is that?)
• Special algorithm for stability analysis of multistable biological regulatory systems
• Verifying Pufferfish privacy in hidden Markov models
• A class of mechanically decidable problems beyond Tarski's model
• Semilinear motion planning in REDLOG
• Quantifier elimination in automatic loop parallelization
• Combining logical and algebraic techniques for natural style proving in elementary analysis
• Title not available (Why is that?)
• A Kochen-Specker system has at least 22 vectors
• Towards an automated reduction method for polynomial ODE models of biochemical reaction systems
• Change-of-bases abstractions for non-linear hybrid systems
• Programming Languages and Systems
• Positive solutions of systems of signed parametric polynomial inequalities
• Reasoning over networks by symbolic methods
• Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
• Finite differences/elements in classical beam problems: Derivation of feasibility conditions under parametric inequality constraints with the help of Reduce and REDLOG
• Automated Technology for Verification and Analysis
• Linear problems in valued fields
• PTIME parametric verification of safety properties for reasonable linear hybrid automata
• Real quantifier elimination by computation of comprehensive Gröbner systems
• Linear-Invariant Generation for Probabilistic Programs:
• Validating numerical semidefinite programming solvers for polynomial invariants
• Title not available (Why is that?)
• An extension of Turán's inequality
• Towards Conflict-Driven Learning for Virtual Substitution
• Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package.
• Title not available (Why is that?)
• On multivariate Hermitian quadratic forms
• Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition
• Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
• Thirty Years of Virtual Substitution
• Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
• Quantifier elimination supported proofs in the numerical treatment of fluid flows
• On the complexity of quantified linear systems
• Hidden verification for computational mathematics
• Title not available (Why is that?)
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• A hypergeometric inequality
• Algorithmic methods for investigating equilibria in epidemic modeling
• A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
• Title not available (Why is that?)
• An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
• Solution formulas for cubic equations without or with constraints
• How to use cylindrical algebraic decomposition
• SyNRAC: A Toolbox for Solving Real Algebraic Constraints
• A Symbolic Approach to Generation and Analysis of Finite Difference Schemes of Partial Differential Equations
• Automatically discovering relaxed Lyapunov functions for polynomial dynamical systems
• A new approach for automatic theorem proving in real geometry
• Real World Verification
• Simple CAD construction and its applications
• On quantified linear implications
• Computer Aided Verification
• Automated Deduction – CADE-20
• Title not available (Why is that?)
• SAT modulo linear arithmetic for solving polynomial constraints
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• Title not available (Why is that?)
• Weak Integer Quantifier Elimination Beyond the Linear Case
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Algebraic analysis on asymptotic stability of continuous dynamical systems
• Generating Polynomial Invariants with DISCOVERER and QEPCAD
• An algebraic method to fidelity-based model checking over quantum Markov chains
• Model checking QCTL plus on quantum Markov chains
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
• Formal Modelling, Analysis and Verification of Hybrid Systems
• Title not available (Why is that?)
• New Domains for Applied Quantifier Elimination
• \(\epsilon\)-semantics computations on biological systems
• Computational complexity and feasibility of data processing and interval computations
• Efficient projection orders for CAD

This page was built for software: REDLOG