349 search results - page 1 / 70 » Recursive Path Orderings Can Also Be Incremental |
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
DBPL
1997
Springer
13 years 9 months ago
1997
Springer
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
JACM
2007
13 years 5 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Internet routing dynamics have been extensively studied in the past few years. However, dynamics such as interdomain Border Gateway Protocol (BGP) behavior are still poorly unders...