Pages that link to "Item:Q2817923"
From MaRDI portal
The following pages link to raSAT: An SMT Solver for Polynomial Constraints (Q2817923):
Displaying 12 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Polynomial constraints and unsat cores in \textsc{Tarski} (Q1662298) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q2055849) (← links)
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description) (Q2104500) (← links)
- A conflict-driven solving procedure for poly-power constraints (Q2303230) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- RegSTAB: A SAT Solver for Propositional Schemata (Q5747769) (← links)
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
- Satisfiability modulo finite fields (Q6535532) (← links)