11740 search results - page 23 / 2348 » More Problems in Rewriting |
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
FSTTCS
2006
Springer
14 years 11 days ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
FORTE
2010
13 years 10 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
RTA
2010
Springer
14 years 18 days ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...