1385 search results - page 25 / 277 » Natural Rewriting for General Term Rewriting Systems |
73
Voted
RTA
2007
Springer
15 years 5 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
CADE
2001
Springer
15 years 4 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
114
click to vote
TCS
2008
14 years 11 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
105
click to vote
DBSEC
2006
15 years 1 months ago
2006
We demonstrate how access control models and policies can be represented by using term rewriting systems, and how rewriting may be used for evaluating access requests and for provi...
FSTTCS
2008
Springer
15 years 25 days ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...