Results 1 
2 of
2
Normalized Rewriting: an alternative to Rewriting modulo a Set of Equations
, 1996
"... this paper is to make the similarity between KnuthBendix completion and the Buchberger algorithm explicit, by describing a general algorithm called Snormalized completion where S is a parameter, such that both algorithms are Normalized Rewriting: an alternative to Rewriting modulo a Set of Equatio ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
this paper is to make the similarity between KnuthBendix completion and the Buchberger algorithm explicit, by describing a general algorithm called Snormalized completion where S is a parameter, such that both algorithms are Normalized Rewriting: an alternative to Rewriting modulo a Set of Equations 3 instances of this general algorithm for a particular choice of S. This has been achieved in two steps.
Normalised Rewriting and Normalised Completion
, 1994
"... We introduce normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example, E can now be the theory of identity, idempotency, the theory of Abelian groups, the theory of commutative rings. We give a new completion algor ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We introduce normalised rewriting, a new rewrite relation. It generalises former notions of rewriting modulo E, dropping some conditions on E. For example, E can now be the theory of identity, idempotency, the theory of Abelian groups, the theory of commutative rings. We give a new completion algorithm for normalised rewriting. It contains as an instance the usual AC completion algorithm, but also the wellknown Buchberger's algorithm for computing standard bases of polynomial ideals. We investigate the particular case of completion of ground equations, In this case we prove by a uniform method that completion modulo E terminates, for some interesting E. As a consequence, we obtain the decidability of the word problem for some classes of equational theories. We give implementation results which shows the efficiency of normalised completion with respect to completion modulo AC. 1 Introduction Equational axioms are very common in most sciences, including computer science. Equations can ...