Linear completion

DOI10.1007/3-540-54317-1_94MaRDI QIDQ5881280zbMATH OpenOpenAlexFDO

Authors Hervé Devie

Publication date 9 March 2023

Published in Conditional and Typed Rewriting Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54317-1_94

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Recommendations

• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Maximal completion
• Partial completion of equational theories
• Completion for unification
• scientific article; zbMATH DE number 1324448

Cites work

• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Existence, Uniqueness, and Construction of Rewrite Systems
• scientific article; zbMATH DE number 8327 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)

Cited in

(4)

• More problems in rewriting
• Extending Maximal Completion (Invited Talk)
• Maximal completion
• Left-linear completion with AC axioms

This page was built for publication: Linear completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881280)