Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm

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].

Saved in:

Bibliographic Details
Published in:	Formalized mathematics Vol. 22; no. 1; pp. 37 - 56
Main Author:	Bancerek, Grzegorz
Format:	Journal Article
Language:	English
Published:	Bialystok Sciendo 30.03.2014 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects:	abstract reduction systems Knuth-Bendix algorithm
ISSN:	1898-9934, 1426-2630, 1898-9934
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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].
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	1898-9934 1426-2630 1898-9934
DOI:	10.2478/forma-2014-0005