40 search results - page 2 / 8 » Regularity and Context-Freeness over Word Rewriting Systems |
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
TASE
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
MST
2006
13 years 4 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...
WEBDB
2000
Springer
13 years 8 months ago
2000
Springer
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...