Elimination transformations for associative-commutative rewriting systems

DOI10.1007/S10817-006-9053-YMaRDI QIDQ877834zbMATH OpenOpenAlexFDO

Authors Kusakari Keiichirou, Nakamura Masaki, Toyama Yoshihito

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)

Recommendations

• scientific article; zbMATH DE number 4047066
• scientific article; zbMATH DE number 4106267
• Termination orderings for associative-commutative rewriting systems
• scientific article; zbMATH DE number 3949707
• scientific article; zbMATH DE number 2043518
• Reduction operators and completion of rewriting systems
• Transformations of Conditional Rewrite Systems Revisited
• Expressing combinatory reduction systems derivations in the rewriting calculus
• The Rewriting Calculus as a Combinatory Reduction System
• Commutative rational term rewriting

Cites work

• scientific article; zbMATH DE number 1614705 (Why is no real title available?)
• scientific article; zbMATH DE number 1670496 (Why is no real title available?)
• scientific article; zbMATH DE number 1722701 (Why is no real title available?)
• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 1765695 (Why is no real title available?)
• scientific article; zbMATH DE number 1765702 (Why is no real title available?)
• Automated Reasoning
• Automating the dependency pair method
• Improving dependency pairs
• Modular and incremental automated termination proofs
• Modular and incremental proofs of AC-termination
• Modular termination proofs for rewriting using dependency pairs
• Modularity of simple termination of term rewriting systems with shared constructors
• Orderings for term-rewriting systems
• Term Rewriting and All That
• Termination of term rewriting using dependency pairs
• Termination of term rewriting: Interpretation and type elimination
• Termination orderings for associative-commutative rewriting systems

Cited in

(3)

• Dummy elimination in equational rewriting
• Dummy elimination: Making termination easier
• scientific article; zbMATH DE number 1614705 (Why is no real title available?)

Describes a project that uses

Uses Software

• AProVE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877834)