Elimination transformations for associative-commutative rewriting systems

DOI10.1007/S10817-006-9053-YzbMath1113.68059OpenAlexW2065666298MaRDI QIDQ877834

Nakamura Masaki, Toyama Yoshihito, Kusakari Keiichirou

Publication date: 3 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9053-y

zbMATH Keywords

AC-termination of term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• AProVE

Cites Work

• Orderings for term-rewriting systems
• Termination orderings for associative-commutative rewriting systems
• Modularity of simple termination of term rewriting systems with shared constructors
• Termination of term rewriting: Interpretation and type elimination
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Automating the dependency pair method
• Modular and incremental automated termination proofs
• Modular and incremental proofs of AC-termination
• Term Rewriting and All That
• Automated Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Elimination transformations for associative-commutative rewriting systems