The following pages link to MU-TERM (Q21990):
Displayed 33 items.
- Multi-completion with termination tools (Q352956) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
- Improving the Context-sensitive Dependency Graph (Q2867962) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← links)
- Usable Rules for Context-Sensitive Rewrite Systems (Q3522013) (← links)
- Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs (Q3525002) (← links)
- MTT: The Maude Termination Tool (System Description) (Q3541712) (← links)
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (Q3558285) (← links)
- From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals (Q3582701) (← links)
- The recursive path and polynomial ordering for first-order and higher-order terms (Q4914419) (← links)
- Proving Termination in the Context-Sensitive Dependency Pair Framework (Q4933276) (← links)
- Operational Termination of Membership Equational Programs: the Order-Sorted Way (Q5179140) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- On the Completeness of Context-Sensitive Order-Sorted Specifications (Q5432344) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- Search Techniques for Rational Polynomial Orders (Q5505493) (← links)
- Term Rewriting and Applications (Q5703855) (← links)