AC-Termination of rewrite systems: A modified Knuth-Bendix ordering
From MaRDI portal
Publication:5096208
DOI10.1007/3-540-53162-9_52zbMath1493.68179OpenAlexW1493914162MaRDI QIDQ5096208
Publication date: 16 August 2022
Published in: Algebraic and Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-53162-9_52
Related Items (3)
Extension of the associative path ordering to a chain of associative commutative symbols ⋮ AC-KBO revisited ⋮ Any ground associative-commutative theory has a finite canonical system
Cites Work
- Termination of rewriting systems by polynomial interpretations and its implementation
- Non-negative integer basis algorithms for linear equations with integer coefficients
- Termination orderings for associative-commutative rewriting systems
- Termination of rewriting
- Completion of a Set of Rules Modulo a Set of Equations
- Extensions and comparison of simplification orderings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: AC-Termination of rewrite systems: A modified Knuth-Bendix ordering
