scientific article; zbMATH DE number 4043234

MaRDI QIDQ3780428zbMATH OpenFDO

Authors Richard Göbel

Publication date 1987

zbMATH Keywords

equational theoryKnuth-Bendix algorithmground confluenceconfluent term rewriting system

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65)

Recommendations

• Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
• Ground confluence prover based on rewriting induction
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• The Knuth-Bendix Completion Procedure and Thue Systems
• On ground-confluence of term rewriting systems

Cited in

(11)

• Complete sets of reductions with constraints
• On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
• Testing for the ground (co-)reducibility property in term-rewriting systems
• Improving rewriting induction approach for proving ground confluence
• scientific article; zbMATH DE number 3928346 (Why is no real title available?)
• scientific article; zbMATH DE number 3990847 (Why is no real title available?)
• A strong restriction of the inductive completion procedure
• Decidability of confluence and termination of monadic term rewriting systems
• Ground confluence prover based on rewriting induction
• On ground and consequence
• scientific article; zbMATH DE number 3956435 (Why is no real title available?)

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 Q3780428)