Modular strategic SMT solving with \textbf{SMT-RAT}
From MaRDI portal
Publication:2414693
Recommendations
Cites work
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- A Computing Procedure for Quantification Theory
- A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic
- A model-constructing satisfiability calculus
- CoCoALib: A C++ library for computations in commutative algebra and beyond
- Constructing a single cell in cylindrical algebraic decomposition
- Fast cube tests for LIA constraint solving
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- Introduction to the GiNaC framework for symbolic computation within the \(\text{C}^{++}\) programming language
- On Gröbner bases in the context of satisfiability-modulo-theories solving over the real numbers
- Proving termination of programs automatically with AProVE
- Quantifier elimination for real algebra -- the quadratic case and beyond
- raSAT: an SMT solver for polynomial constraints
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Solving non-linear arithmetic
- Solving nonlinear integer arithmetic with MCSAT
- Subtropical satisfiability
- The MathSAT5 SMT solver
- Theory and Applications of Satisfiability Testing
- Virtual substitution for SMT-solving
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Modular strategic SMT solving with \textbf{SMT-RAT}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2414693)
