On proving properties of completion strategies

DOI10.1007/3-540-53904-2_113zbMath1503.68114OpenAlexW1575657571MaRDI QIDQ5055777

Miki Hermann

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-53904-2_113

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (1)

On proving properties of completion strategies

Cites Work

• The propositional dynamic logic of deterministic, well-structured programs
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Process logic: Expressiveness, decidability, completeness
• Propositional dynamic logic of regular programs
• On proving properties of completion strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On proving properties of completion strategies