Pages that link to "Item:Q751830"
From MaRDI portal
The following pages link to Automating the Knuth Bendix ordering (Q751830):
Displaying 17 items.
- KBO orientability (Q846165) (← links)
- Things to know when implementing KBO (Q861708) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- Simple termination of rewrite systems (Q1392146) (← links)
- Orienting rewrite rules with the Knuth-Bendix order. (Q1401932) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Invariants, patterns and weights for ordering terms (Q1581131) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- An Extension of the Knuth-Bendix Ordering with LPO-Like Properties (Q3498479) (← links)
- The order types of termination orderings on monadic terms, strings and multisets (Q4358058) (← links)
- Transforming SAT into Termination of Rewriting (Q4982632) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- Derivation lengths and order types of Knuth--Bendix orders (Q5958622) (← links)