Knuth-Bendix Completion for Non-Symmetric Transitive Relations

DOI10.1016/S1571-0661(04)00296-8zbMath1268.68068OpenAlexW2070304550MaRDI QIDQ2841250

Georg Struth

Publication date: 24 July 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00296-8

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Structures for abstract rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bi-rewrite systems
• Termination orderings for associative-commutative rewriting systems
• Conditional rewriting logic as a unified model of concurrency
• Completion of rewrite systems with membership constraints. I: Deduction rules
• Buchberger's algorithm: The term rewriter's point of view
• Shostak's congruence closure as completion

This page was built for publication: Knuth-Bendix Completion for Non-Symmetric Transitive Relations