On ground-confluence of term rewriting systems

DOI10.1016/0890-5401(90)90023-BzbMath0699.68041MaRDI QIDQ913496

Deepak Kapur, Paliath Narendran, Friedrich Otto

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

confluenceprocedureKnuth-Bendix completionChurch-Rosser propertyNoetherian term rewriting system

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Undecidability and degrees of sets of sentences (03D35) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Thue and Post systems, etc. (03D03)

Related Items (12)

Decidability of confluence and termination of monadic term rewriting systems ⋮ It is decidable whether a monadic thue system is canonical over a regular set ⋮ On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories ⋮ Sufficient completeness verification for conditional and constrained TRS ⋮ On using ground joinable equations in equational theorem proving ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Murg term rewrite systems ⋮ Certified equational reasoning via ordered completion ⋮ Automating inductionless induction using test sets ⋮ Induction = I-axiomatization + first-order consistency. ⋮ Deductive and inductive synthesis of equational programs ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Cites Work

• Finite complete rewriting systems and the complexity of word problem
• On two problems related to cancellativity
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Reductions in tree replacement systems
• Semantic confluence tests and completion methods
• Confluent and Other Types of Thue Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On ground-confluence of term rewriting systems