Pages that link to "Item:Q5191109"

The following pages link to Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109):

Displaying 7 items.

• SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
• Generating invariants for non-linear hybrid systems (Q2355695) (← links)
• SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
• $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
• A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
• Proving Termination Properties with mu-term (Q3067476) (← links)
• Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)