1385 search results - page 12 / 277 » Natural Rewriting for General Term Rewriting Systems |
122
Voted
SIGMOD
1992
ACM
15 years 3 months ago
1992
ACM
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
106
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
127
click to vote
RTA
2011
Springer
14 years 2 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
107
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...