SMT-RAT
From MaRDI portal
Software:25009
swMATH13091MaRDI QIDQ25009FDOQ25009
Author name not available (Why is that?)
Source code repository: https://github.com/smtrat/smtrat/wiki
Cited In (19)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation
- Building bridges between symbolic computation and satisfiability checking
- Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Algorithmic reduction of biological networks with multiple time scales
- Adapting Real Quantifier Elimination Methods for Conflict Set Computation
- Fully incremental cylindrical algebraic decomposition
- Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
- Solving Nonlinear Integer Arithmetic with MCSAT
- On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
- Positive solutions of systems of signed parametric polynomial inequalities
- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms
- raSAT: An SMT Solver for Polynomial Constraints
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Modular strategic SMT solving with \textbf{SMT-RAT}
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description)
This page was built for software: SMT-RAT
