About the rewriting systems produced by the Knuth-Bendix completion algorithm
From MaRDI portal
Cites work
- A complete proof of correctness of the Knuth-Bendix completion algorithm
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 3810943 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
Cited in
(19)- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Termination of rewriting
- History and basic features of the critical-pair/completion procedure
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- How to decide the lark
- On the duality of abduction and model generation in a framework for model generation with equality
- On the descriptive power of term rewriting systems
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Confluence by critical pair analysis revisited
- Abstract canonical presentations
- Polygraphs of finite derivation type
- Multi-completion with termination tools
- Higher-dimensional normalisation strategies for acyclicity
- Efficient ground completion
- scientific article; zbMATH DE number 7204438 (Why is no real title available?)
- On interreduction of semi-complete term rewriting systems
- Rewrite systems for varieties of semigroups
- Left-linear completion with AC axioms
- 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)
