209 search results - page 4 / 42 » Termination of Priority Rewriting |
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
DEXA
2003
Springer
14 years 26 days ago
2003
Springer
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
WFLP
2009
Springer
14 years 2 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...