Dependency Pairs and Polynomial Path Orders

04/06/2009
by   Martin Avanzini, et al.
0

We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/15/2011

Automated Complexity Analysis Based on the Dependency Pair Method

This article is concerned with automated complexity analysis of term rew...
04/24/2018

Higher-order dependency pairs

Arts and Giesl proved that the termination of a first-order rewrite syst...
04/03/2009

The Derivational Complexity Induced by the Dependency Pair Method

We study the derivational complexity induced by the dependency pair meth...
07/01/2020

Constructing Basis Path Set by Eliminating Path Dependency

The way the basis path set works in neural network remains mysterious, a...
06/27/2019

Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting

Dependency pairs are a key concept at the core of modern automated termi...
04/09/2016

Chordal networks of polynomial ideals

We introduce a novel representation of structured polynomial ideals, whi...
05/25/2016

Unsupervised Word and Dependency Path Embeddings for Aspect Term Extraction

In this paper, we develop a novel approach to aspect term extraction bas...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.