Normalised Rewriting and Normalised Completion

Normalised Rewriting and Normalised Completion (1994)

by Claude Marche

Citations:

18 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Normalised Rewriting and Normalised Completion	SVM HeaderParse 0.1
AUTHOR NAME	Claude Marche	user correction - Legacy Corrections
ABSTRACT	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 ...	user correction - Legacy Corrections
YEAR	1994	user correction - Legacy Corrections
CITATIONS	33 found	ParsCit 1.0