Pages that link to "Item:Q5313720"

The following pages link to Polynomials over the reals in proofs of termination : from theory to practice (Q5313720):

Displaying 17 items.

• SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
• Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
• Tyrolean termination tool: techniques and features (Q876042) (← links)
• Mechanizing and improving dependency pairs (Q877836) (← links)
• Context-sensitive dependency pairs (Q989290) (← links)
• Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
• Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
• Use of Logical Models for Proving Operational Termination in General Logics (Q2827835) (← links)
• Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
• Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
• Proving Termination Properties with mu-term (Q3067476) (← links)
• Size-based termination of higher-order rewriting (Q4577817) (← links)
• Automatic Proofs of Termination With Elementary Interpretations (Q5170190) (← links)
• Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
• Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
• Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)