Sciweavers

889 search results - page 15 / 178
» Problems in Rewriting III
Sort
View
FSTTCS
2006
Springer
14 years 1 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
CIKM
2007
Springer
14 years 4 months ago
Towards practically feasible answering of regular path queries in lav data integration
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 10 months ago
Query containment and rewriting using views for regular path queries under constraints
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...
Gösta Grahne, Alex Thomo
VLDB
2007
ACM
152views Database» more  VLDB 2007»
14 years 10 months ago
Structured Materialized Views for XML Queries
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...
Andrei Arion, Ioana Manolescu, Véronique Be...
FSTTCS
2006
Springer
14 years 1 months ago
Context-Sensitive Dependency Pairs
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...
Beatriz Alarcón, Raúl Gutiérr...