Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering

DOI10.1007/978-3-642-40885-4_22zbMath1398.68268OpenAlexW291680708MaRDI QIDQ2849497

Takahito Aoto

Publication date: 20 September 2013

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40885-4_22

zbMATH Keywords

orderingconfluenceterm rewriting systemsinterpretationnon-joinability

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Use of logical models for proving infeasibility in term rewriting ⋮ Proving semantic properties as first-order satisfiability ⋮ Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems ⋮ Improving rewriting induction approach for proving ground confluence ⋮ Term orderings for non-reachability of (conditional) rewriting

Uses Software

• Tyrolean
• CSI
• Saigawa

This page was built for publication: Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering