scientific article; zbMATH DE number 3891336

From MaRDI portal
Publication:3347863





[For the entire collection see Zbl 0538.00024.] The Knuth and Bendix completion algorithm may fail in the case when there are relations between constructors. The author proposes a generalization of the inductive proof method of Huet and Hullot for the case that the relations between constructors are (combinations of) simplifiers, commutativity, associativity. The principal ideas (helping in the removing of some failure cases) are: the introduction of the notion of inductive completeness (a property which the relations must have); the use of an (automatic) simplification of equations. Also, there must exist a complete term rewriting system which can be built from the relations. Examples and possible extensions are presented.




Cited in
(27)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347863)