Pages that link to "Item:Q3066114"
From MaRDI portal
The following pages link to Satisfiability of Non-linear (Ir)rational Arithmetic (Q3066114):
Displaying 14 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Uncurrying for termination and complexity (Q352959) (← links)
- Decreasing diagrams and relative termination (Q438562) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Satisfiability modulo transcendental functions via incremental linearization (Q2405243) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra (Q3014943) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)