Pages that link to "Item:Q438576"
From MaRDI portal
The following pages link to SAT modulo linear arithmetic for solving polynomial constraints (Q438576):
Displaying 6 items.
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic (Q2058375) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
