Thomas Sturm

Ovidiu Radulescu

CoRR, 2022

2021

A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations.

[BibT_eX]

[DOI]

Werner M. Seiler

Matthias Seiß

Math. Comput. Sci., 2021

Algorithmic Reduction of Biological Networks with Multiple Time Scales.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Efficiently and Effectively Recognizing Toricity of Steady State Varieties.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Foreword, with a Dedication to Andreas Weber.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Foreword, with a Dedication to Vladimir Gerdt.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2021

Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner System.

[BibT_eX]

[DOI]

CoRR, 2021

Testing Binomiality of Chemical Reaction Networks Using Comprehensive Gröbner Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

Parametric Toricity of Steady State Varieties of Reaction Networks.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020

Symbolic computation and satisfiability checking.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

A complete and terminating approach to linear integer solving.

[BibT_eX]

[DOI]

Martin Bromberger

Christoph Weidenbach

J. Symb. Comput., 2020

Identifying the parametric occurrence of multiple steady states for some biological networks.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks.

[BibT_eX]

[DOI]

CoRR, 2020

First-Order Tests for Toricity.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

A Linear Algebra Approach for Detecting Binomiality of Steady State Ideals of Reversible Chemical Reaction Networks.

[BibT_eX]

[DOI]

Ovidiu Radulescu

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2018

The SYMBIONT project: symbolic methods for biological networks.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2018

Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT.

[BibT_eX]

[DOI]

Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

Thirty Years of Virtual Substitution: Foundations, Techniques, Applications.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Positive Solutions of Systems of Signed Parametric Polynomial Inequalities.

[BibT_eX]

[DOI]

Hoon Hong

Proceedings of the Computer Algebra in Scientific Computing - 20th International Workshop, 2018

2017

A Survey of Some Methods for Real Quantifier Elimination, Decision, and Satisfiability and Their Applications.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2017

A Case Study on the Parametric Occurrence of Multiple Steady States.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Subtropical Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017

2016

Better answers to real questions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Satisfiability Checking meets Symbolic Computation (Project Paper).

[BibT_eX]

[DOI]

CoRR, 2016

Satisfiability checking and symbolic computation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2016

SC<sup>2</sup>: Satisfiability Checking Meets Symbolic Computation - (Project Paper).

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 9th International Conference, 2016

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated.

[BibT_eX]

[DOI]

Marco Voigt

Christoph Weidenbach

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Foreword to the Special Focus on Constraints and Combinations.

[BibT_eX]

[DOI]

Pascal Fontaine

Uwe Waldmann

Math. Comput. Sci., 2015

Detection of Hopf bifurcations in chemical reaction networks using convex coordinates.

[BibT_eX]

[DOI]

J. Comput. Phys., 2015

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2015

A Generalized Framework for Virtual Substitution.

[BibT_eX]

[DOI]

CoRR, 2015

Subtropical Real Root Finding.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Linear Integer Arithmetic Revisited.

[BibT_eX]

[DOI]

Martin Bromberger

Christoph Weidenbach

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Towards Conflict-Driven Learning for Virtual Substitution.

[BibT_eX]

[DOI]

Konstantin Korovin

Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013

Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages.

[BibT_eX]

[DOI]

Ralf Karrenberg

Proceedings of the Frontiers of Combining Systems, 2013

Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 15th International Workshop, 2013

2012

Foreword.

[BibT_eX]

[DOI]

Stefan Ratschan

Math. Comput. Sci., 2012

Symbolic Methods for Chemical Reaction Networks (Dagstuhl Seminar 12462).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

2011

Verification and synthesis using real quantifier elimination.

[BibT_eX]

[DOI]

Ashish Tiwari

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

On Muldowney's Criteria for Polynomial Vector Fields with Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 13th International Workshop, 2011

2010

Parametric quantified SAT solving.

[BibT_eX]

[DOI]

Christoph Zengler

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra.

[BibT_eX]

[DOI]

Proceedings of the Verification over discrete-continuous boundaries, 04.07. - 09.07.2010, 2010

Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk).

[BibT_eX]

[DOI]

Andreas Weber

Werner M. Seiler

Essam O. Abdel-Rahman

Proceedings of the Computer Algebra in Scientific Computing - 12th International Workshop, 2010

Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests.

[BibT_eX]

[DOI]

Winfried Neun

Stefan Vigerske

Proceedings of the Computer Algebra in Scientific Computing - 12th International Workshop, 2010

2009

Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology.

[BibT_eX]

[DOI]

Andreas Weber

Essam O. Abdel-Rahman

M'hammed El Kahoui

Math. Comput. Sci., 2009

Effective Quantifier Elimination for Presburger Arithmetic with Infinity.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008

Automatic Verification of the Adequacy of Models for Families of Geometric Objects.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 7th International Workshop, 2008

Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology.

[BibT_eX]

[DOI]

Andreas Weber

Proceedings of the Algebraic Biology, Third International Conference, 2008

2007

Weak quantifier elimination for the full linear theory of the integers.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2007

Editorial.

[BibT_eX]

[DOI]

Hirokazu Anai

Appl. Algebra Eng. Commun. Comput., 2007

Weak Integer Quantifier Elimination Beyond the Linear Case.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 10th International Workshop, 2007

2006

Editorial.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

New Domains for Applied Quantifier Elimination.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 9th International Workshop, 2006

2005

Quantifier Elimination for Constraint Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 8th International Workshop, 2005

2004

Efficient projection orders for CAD.

[BibT_eX]

[DOI]

Andreas Seidl

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

A generic projection operator for partial cylindrical algebraic decomposition.

[BibT_eX]

[DOI]

Andreas Seidl

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

Integration of Quantifier Elimination with Constraint Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence, 2002

2001

Parametric Systems of Linear Congruences.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing, 2001

2000

Linear Problems in Valued Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

1999

Reasoning over Networks by Symbolic Methods.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1999

P-adic Constraint Solving.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998

A New Approach for Automatic Theorem Proving in Real Geometry.

[BibT_eX]

[DOI]

Volker Weispfenning

J. Autom. Reason., 1998

Approaches to Parallel Quantifier Elimination.

[BibT_eX]

[DOI]

Oliver Gloor

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

Simplification of Quantifier-Free Formulae over Ordered Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1997

REDLOG: computer algebra meets computer logic.

[BibT_eX]

[DOI]

SIGSAM Bull., 1997

Guarded Expressions in Practice.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Real Quantifier Elimination in Practice.

[BibT_eX]

[DOI]

Volker Weispfenning

Proceedings of the Algorithmic Algebra and Number Theory, 1997

1996

Computational Geometry Problems in REDLOG.

[BibT_eX]

[DOI]