A path ordering for proving termination of AC rewrite systems

DOI10.1007/BF00881859zbMath0819.68115MaRDI QIDQ1891259

G. Sivakumar, Deepak Kapur, Han-Tao Zhang

Publication date: 30 May 1995

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

zbMATH Keywords

path orderingAC rewrite systemsrewrite rule laboratory

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Uses Software

• RRL
• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting systems by polynomial interpretations and its implementation
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Termination orderings for associative-commutative rewriting systems
• Termination of rewriting
• Associative-commutative reduction orderings
• Unnecessary inferences in associative-commutative completion procedures
• Complete Sets of Reductions for Some Equational Theories

This page was built for publication: A path ordering for proving termination of AC rewrite systems