Pages that link to "Item:Q1688535"
From MaRDI portal
The following pages link to raSAT: an SMT solver for polynomial constraints (Q1688535):
Displaying 10 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Polynomial constraints and unsat cores in \textsc{Tarski} (Q1662298) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- Modular strategic SMT solving with \textbf{SMT-RAT} (Q2414693) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- RegSTAB: A SAT Solver for Propositional Schemata (Q5747769) (← links)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test (Q6160909) (← links)
- Local search for solving satisfiability of polynomial formulas (Q6535529) (← links)
- Certified SAT solving with GPU accelerated inprocessing (Q6564174) (← links)