Chain properties of rule closures

DOI10.1007/BF01888225zbMath0703.68066OpenAlexW2024574878MaRDI QIDQ916402

Miki Hermann

Publication date: 1990

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01888225

zbMATH Keywords

term-rewriting systemsdivergence processKnuth-Bendix completion procedure

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items

A strategy to deal with divergent rewrite systems, Meta-rule synthesis from crossed rewrite systems, Solving divergence in Knuth--Bendix completion by enriching signatures, Schematization of infinite sets of rewrite rules generated by divergent completion processes

Uses Software

• REVE

Cites Work

• Unnamed Item
• Termination of rewriting systems by polynomial interpretations and its implementation
• Termination of rewriting
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Schematization of infinite sets of rewrite rules generated by divergent completion processes
• On Proving Uniform Termination and Restricted Termination of Rewriting Systems
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Tree-Manipulating Systems and Church-Rosser Theorems