Generalizing Weighted Path Orders

07/26/2023
by   Teppei Saito, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2009

Dependency Pairs and Polynomial Path Orders

We show how polynomial path orders can be employed efficiently in conjun...
research
08/20/2018

The asymmetric traveling salesman path LP has constant integrality ratio

We show that the classical LP relaxation of the asymmetric traveling sal...
research
07/17/2018

Expressing Linear Orders Requires Exponential-Size DNNFs

We show that any DNNF circuit that expresses the set of linear orders ov...
research
02/06/2018

Resilient Blocks for Summarising Distributed Data

Summarising distributed data is a central routine for parallel programmi...
research
03/02/2020

Generalizing cyclomatic complexity via path homology

Cyclomatic complexity is an incompletely specified but mathematically pr...
research
01/17/2023

Weighted and Branching Bisimilarities from Generalized Open Maps

In the open map approach to bisimilarity, the paths and their runs in a ...
research
01/18/2022

Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball

We consider the numerical integration INT_d(f)=∫_𝔹^df(x)w_μ(x)dx f...

Please sign up or login with your details

Forgot password? Click here to reset