Unifying Semantic Path Order and Weighted Path Order
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916058720370688 |
|---|---|
| author | Saito, Teppei Hirokawa, Nao |
| author_facet | Saito, Teppei Hirokawa, Nao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_29393 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Unifying Semantic Path Order and Weighted Path Order Saito, Teppei Hirokawa, Nao Logic in Computer Science 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. |
| title | Unifying Semantic Path Order and Weighted Path Order |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2605.29393 |