Dependency Pairs and Polynomial Path Orders

Details Dependency Pairs and Polynomial Path Orders Dependency Pairs and Polynomial Path Orders

2009-04-06

arxiv.org/abs/0904.0981v3

Computer Science

Logic in Computer Science

23 pages, conference version accepted at RTA 2009

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dependency Pairs and Polynomial Path Orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dependency Pairs and Polynomial Path Orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependency Pairs and Polynomial Path Orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-133620