Pages that link to "Item:Q1836978"
From MaRDI portal
The following pages link to About the rewriting systems produced by the Knuth-Bendix completion algorithm (Q1836978):
Displaying 17 items.
- Multi-completion with termination tools (Q352956) (← links)
- Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- Termination of rewriting (Q1098624) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- How to decide the lark (Q1208736) (← links)
- On the duality of abduction and model generation in a framework for model generation with equality (Q1314425) (← links)
- On the descriptive power of term rewriting systems (Q1819932) (← links)
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre (Q2266711) (← links)
- Confluence by critical pair analysis revisited (Q2305423) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Polygraphs of finite derivation type (Q3130298) (← links)
- Efficient ground completion (Q5055736) (← links)
- (Q5111315) (← links)
- On interreduction of semi-complete term rewriting systems (Q5941203) (← links)
