AbstractWe provide complete axiomatizations for several fragments of Core XPath, the navigational core of XPath 1.0 introduced by Gottlob, Koch and Pichler. A complete axiomatization for a given fragment is a set of equivalences from which every other valid equivalence is derivable; equivalences can be thought of as (undirected) rewrite rules. Specifically, we axiomatize single axis fragments of Core XPath as well as full Core XPath. Our completeness proofs use results and techniques from modal logic
Propositional -calculus is an extension of the propositional modal logic with the least xpoint opera...
Περιέχει το πλήρες κείμενοIn this paper, we study the problem of finding an equivalent rewriting of ...
In this paper, we develop a framework for obtaining completeness results for extensions of modal log...
We provide complete axiomatizations for several fragments of Core XPath, the navigational core of XP...
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...
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...
We study structural properties of each of the main sublanguages of XPath~\cite{xpath} commonly used ...
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...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
Propositional -calculus is an extension of the propositional modal logic with the least xpoint opera...
Περιέχει το πλήρες κείμενοIn this paper, we study the problem of finding an equivalent rewriting of ...
In this paper, we develop a framework for obtaining completeness results for extensions of modal log...
We provide complete axiomatizations for several fragments of Core XPath, the navigational core of XP...
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...
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...
We study structural properties of each of the main sublanguages of XPath~\cite{xpath} commonly used ...
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...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of var...
Propositional -calculus is an extension of the propositional modal logic with the least xpoint opera...
Περιέχει το πλήρες κείμενοIn this paper, we study the problem of finding an equivalent rewriting of ...
In this paper, we develop a framework for obtaining completeness results for extensions of modal log...