Abstract reduction systems and idea of Knuth-Bendix completion algorithm

DOI10.2478/FORMA-2014-0005MaRDI QIDQ467811zbMATH OpenOpenAlexFDO

Authors Grzegorz Bancerek

Publication date 5 November 2014

Published in Formalized Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.2478/forma-2014-0005

zbMATH Keywords

abstract reduction systemsKnuth-Bendix algorithm

Mathematics Subject Classification ID

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

Recommendations

• Completeness and reduction in algebraic complexity theory
• scientific article; zbMATH DE number 4076598
• Combinatory reduction systems: Introduction and survey
• scientific article; zbMATH DE number 3850464
• Algorithmic reducibilities of algebraic structures
• The Knuth-Bendix Completion Procedure and Thue Systems
• Reductions, completeness and the hardness of approximability
• scientific article; zbMATH DE number 3928345
• Reduction operators and completion of rewriting systems
• scientific article; zbMATH DE number 3856444

Cites work

• scientific article; zbMATH DE number 108365 (Why is no real title available?)
• scientific article; zbMATH DE number 4197282 (Why is no real title available?)
• Semantics of MML query -- ordering

This page was built for publication: Abstract reduction systems and idea of Knuth-Bendix completion algorithm

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