500 search results - page 79 / 100 » ACD Term Rewriting |
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
IJSI
2008
13 years 7 months ago
2008
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...