Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Lexicographic Combination of Reduction Pairs (Extended Version)
Teppei Saito, Nao Hirokawa
We present a simple criterion for combining reduction pairs lexicographically. The criterion is applicable to arbitrary classes of reduction pairs, such as the polynomial interpret…
cs.LO2026
Unifying Semantic Path Order and Weighted Path Order
Teppei Saito, Nao Hirokawa
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 unifica…
cs.LO2023
Generalizing Weighted Path Orders
Teppei Saito, Nao Hirokawa
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes…