Completion and reduction orders (invited talk)

DOI10.4230/LIPICS.FSCD.2021.2MaRDI QIDQ6159916zbMATH OpenFDO

Authors Nao Hirokawa

Publication date 23 June 2023

zbMATH Keywords

term rewritingcompletionreduction order

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx) Computer science (68-XX)

Recommendations

• Extending Maximal Completion (Invited Talk)
• scientific article; zbMATH DE number 4076598
• Completion for multiple reduction orderings
• scientific article; zbMATH DE number 3928345
• Slothrop: Knuth-Bendix Completion with a Modern Termination Checker

Cited in

(1)

• Completion for multiple reduction orderings

This page was built for publication: Completion and reduction orders (invited talk)

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