Associative-commutative reduction orderings

DOI10.1016/0020-0190(92)90024-PzbMath0759.68043OpenAlexW1991759334MaRDI QIDQ1198005

Leo Bachmair

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90024-p

zbMATH Keywords

rewrite systemassociativitycommutativityreduction ordering

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (8)

Path orderings for termination of associative-commutative rewriting ⋮ A path ordering for proving termination of AC rewrite systems ⋮ A precedence-based total AC-compatible ordering ⋮ Extension of the associative path ordering to a chain of associative commutative symbols ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ A fully syntactic AC-RPO. ⋮ A total AC-compatible ordering based on RPO ⋮ Conditional narrowing modulo a set of equations

Cites Work

• Termination orderings for associative-commutative rewriting systems
• Termination of rewriting
• Unnamed Item
• Unnamed Item

This page was built for publication: Associative-commutative reduction orderings