Franz Winkler
Abstract
An important problem both in computer algebra and special theorem proving in connection with automatic program verification is the calculation of canonical forms with respect to some given side relations. If these side relations can be viewed as a rewrite system which has the Church-Rosser property then a normal form algorithm with respect to this system provides a canonical simplifier. For many computational domains there exists a "completion algorithm" for transforming an arbitrary rewrite system into an equivalent one which has the Church-Rosser property. Improvements to the existing completion algorithms are presented. A very general completion algorithm is described which contains all these various algorithms as special cases. A complexity bound for the Buchberger algorithm for trivariate polynomial equations is derived.
Recommendations
Modular church-rosser modulo
RTA'06: Proceedings of the 17th international conference on Term Rewriting and ApplicationsIn [12], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on ...
A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser
Basic properties of rewriting systems can be stated in the framework of abstract reduction systems (ARS). Properties like confluence (or Church-Rosser, CR) and weak confluence (or weak Church-Rosser, WCR) and their relationships can be studied in this ...
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83: Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2The well known Knuth and Bendix completion procedure computes a convergent term rewriting system from a given set of equational axioms. This procedure was extended to handle mixed sets of rules and equations in order to deal with axioms that cannot be ...
Comments