Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
| 30 mar 2014
INFORMAZIONI SU QUESTO ARTICOLO
Pubblicato online: 30 mar 2014
Pagine: 37 - 56
DOI: https://doi.org/10.2478/forma-2014-0005
Parole chiave
© by Grzegorz Bancerek
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License. (CC BY-SA 3.0)
Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].