Add to ORKGWe provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specically, we axiomatize downward single axis fragments of Core XPath (that is, Core XPath(↓) and Core XPath(↓+)) as well as the full Core XPath. We make use of techniques from modal logic
Abstract. XPath was introduced as the standard language for addressing parts of XML documents, and h...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, ...
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which ...
AbstractWe provide complete axiomatizations for several fragments of Core XPath, the navigational co...
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidabl...
AbstractWe study structural properties of each of the main sublanguages of navigational XPath (W3c R...
We study structural properties of each of the main sublanguages of XPath~\cite{xpath} commonly used ...
This paper provides several examples of how known results in modal logic can be applied to the XML d...
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constrain...
The containment and equivalence problems for various fragments of XPath have been studied by a numbe...
We give semantic characterizations of the expressive power of navigational XPath (a.k.a. Core XPath)...
We give semantic characterizations of the expressive powerof navigational XPath (also called Core XP...
In this work we investigate the satisfiability problem for the logic XPath(↓∗, ↓,=), that includes a...
Περιέχει το πλήρες κείμενοIn this paper, we study the problem of finding an equivalent rewriting of ...
Abstract. XPath was introduced as the standard language for addressing parts of XML documents, and h...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, ...
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which ...
AbstractWe provide complete axiomatizations for several fragments of Core XPath, the navigational co...
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidabl...
AbstractWe study structural properties of each of the main sublanguages of navigational XPath (W3c R...
We study structural properties of each of the main sublanguages of XPath~\cite{xpath} commonly used ...
This paper provides several examples of how known results in modal logic can be applied to the XML d...
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constrain...
The containment and equivalence problems for various fragments of XPath have been studied by a numbe...
We give semantic characterizations of the expressive power of navigational XPath (a.k.a. Core XPath)...
We give semantic characterizations of the expressive powerof navigational XPath (also called Core XP...
In this work we investigate the satisfiability problem for the logic XPath(↓∗, ↓,=), that includes a...
Περιέχει το πλήρες κείμενοIn this paper, we study the problem of finding an equivalent rewriting of ...
Abstract. XPath was introduced as the standard language for addressing parts of XML documents, and h...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, ...