127 search results - page 9 / 26 » Algebraic Characterization of Logically Defined Tree Languag... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
LPNMR
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...