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 ...
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 ...
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 ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...