The following pages link to Maximal Termination (Q3522012):
Displaying 14 items.
- KBO orientability (Q846165) (← links)
- Increasing interpretations (Q1044231) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Maximal Termination (Q3522012) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Monotonicity Criteria for Polynomial Interpretations over the Naturals (Q5747787) (← links)
- On complexity bounds and confluence of parallel term rewriting (Q6622000) (← links)
