1385 search results - page 50 / 277 » Natural Rewriting for General Term Rewriting Systems |
188
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
162
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
141
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
164
click to vote
ICNP
1998
IEEE
15 years 10 months ago
1998
IEEE
To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in such designs is the need to direc...
155
click to vote
CADE
2012
Springer
13 years 8 months ago
2012
Springer
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...