Satisfiability of non-linear (ir)rational arithmetic
From MaRDI portal
Recommendations
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- Solving non-linear arithmetic
- Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions
- Solving nonlinear integer arithmetic with MCSAT
- SAT modulo linear arithmetic for solving polynomial constraints
Cited in
(19)- Optimization modulo non-linear arithmetic via incremental linearization
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Uncurrying for termination and complexity
- Subtropical satisfiability
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- Decreasing diagrams and relative termination
- SAT modulo linear arithmetic for solving polynomial constraints
- A generalised branch-and-bound approach and its application in SAT modulo nonlinear integer arithmetic
- The strategy challenge in SMT solving
- Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions
- On the complexity of convex and reverse convex prequadratic constraints
- Joint spectral radius theory for automated complexity analysis of rewrite systems
- Satisfiability modulo transcendental functions via incremental linearization
- raSAT: an SMT solver for polynomial constraints
- I-RiSC: an SMT-compliant solver for the existential fragment of real algebra
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
- raSAT: An SMT Solver for Polynomial Constraints
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
This page was built for publication: Satisfiability of non-linear (ir)rational arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066114)
