scientific article

zbMath0759.68048MaRDI QIDQ4027631

Emmanuel Kounalis

Publication date: 21 February 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

term rewriting systemsequationstest setsproof by consistencyground terms in normal form

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Computing linearizations using test sets ⋮ On sufficient completeness of conditional specifications ⋮ Implicit induction in conditional theories ⋮ Proofs in parameterized specifications ⋮ Program transformation and rewriting ⋮ On relationship between term rewriting systems and regular tree languages ⋮ Towards an efficient construction of test sets for deciding ground reducibility ⋮ Reasoning with conditional axioms ⋮ Equality and disequality constraints on direct subterms in tree automata ⋮ Decidability of regularity and related properties of ground normal form languages