889 search results - page 61 / 178 » Problems in Rewriting III |
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
PODS
2003
ACM
14 years 10 months ago
2003
ACM
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
RTA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
AGTIVE
2007
Springer
14 years 4 months ago
2007
Springer
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...