Pages that link to "Item:Q438576"

The following pages link to SAT modulo linear arithmetic for solving polynomial constraints (Q438576):

Displaying 18 items.

• Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
• Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
• New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
• raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
• Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic (Q2058375) (← 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)
• Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
• raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
• Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
• Comparing CSP and SAT solvers for polynomial constraints in termination provers (Q2871851) (← links)
• Inferring Congruence Equations Using SAT (Q3512500) (← links)
• (Q4427902) (← links)
• Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (Q5892495) (← links)
• Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
• SAT Modulo Differential Equation Simulations (Q6487261) (← links)
• On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)