About the rewriting systems produced by the Knuth-Bendix completion algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3810943 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Cited in
(18)- Confluence by critical pair analysis revisited
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- scientific article; zbMATH DE number 7204438 (Why is no real title available?)
- On the duality of abduction and model generation in a framework for model generation with equality
- Termination of rewriting
- Higher-dimensional normalisation strategies for acyclicity
- Multi-completion with termination tools
- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- Abstract canonical presentations
- Rewrite systems for varieties of semigroups
- On the descriptive power of term rewriting systems
- How to decide the lark
- Polygraphs of finite derivation type
- On interreduction of semi-complete term rewriting systems
- Efficient ground completion
- Rigid E-unification: NP-completeness and applications to equational matings
This page was built for publication: About the rewriting systems produced by the Knuth-Bendix completion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836978)
