889 search results - page 8 / 178 » Problems in Rewriting III |
ACL
2012
13 years 17 days ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
AAAI
2006
14 years 11 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
123
click to vote
MST
2006
14 years 10 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
CP
1999
Springer
15 years 2 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
RTA
1993
Springer
15 years 2 months ago
1993
Springer