1385 search results - page 83 / 277 » Natural Rewriting for General Term Rewriting Systems |
258
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
168
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we propose a versatile disambiguation approach which can be used to make explicit the meaning of structure based information such as XML schemas, XML document struc...
222
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
167
click to vote
WIDM
2003
ACM
15 years 11 months ago
2003
ACM
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
142
click to vote
LDTA
2010
15 years 6 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...