Unifying Semantic Path Order and Weighted Path Order
arXiv:2605.29393
Abstract
Monotonic semantic path orders and weighted path orders are powerful reduction orders for proving termination of term rewrite systems. In this paper we present their simple unification as reduction orders and reduction pairs. We also discuss the use of it as ground total reduction orders.
Presented at WST 2026