889 search results - page 10 / 178 » Problems in Rewriting III |
92
Voted
ICEC
1996
15 years 3 months ago
1996
78
Voted
CORR
1998
Springer
15 years 1 months ago
1998
Springer
155
click to vote
RTA
1993
Springer
15 years 6 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
124
click to vote
ENTCS
2008
15 years 1 months ago
2008
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
111
click to vote
SIGECOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...