Generalizing Weighted Path Orders
Logic in Computer Science
2023-07-27 v1
Abstract
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 beyond the realm of simple termination. Experimental data show that generalized weighted path orders are viable.
Cite
@article{arxiv.2307.13973,
title = {Generalizing Weighted Path Orders},
author = {Teppei Saito and Nao Hirokawa},
journal= {arXiv preprint arXiv:2307.13973},
year = {2023}
}
Comments
Presented at WST 2023