We investigate model theoretic properties of XPath with data (in)equality tests over the class of data trees, i.e., the class of trees where each node contains a label from a finite alphabet and a data value from an infinite domain.We provide notions of (bi)simulations for XPath logics containing the child, descendant, parent and ancestor axes to navigate the tree. We show that these notions precisely characterize the equivalence relation associated with each logic. We study formula complexity measures consisting of the number of nested axes and nested subformulas in a formula; these notions are akin to the notion of quantifier rank in first-order logic. We show char- acterization results for fine grained notions of equivalence and (bi)simu...
We present an algorithm to solve XPath decision problems under regular tree type constraints and sho...
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constrain...
A data tree is a tree whose every node carries a label from a finite alphabet and a datum from some ...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equa...
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equa...
We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests o...
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, ...
We study a logic on multi-attribute data trees. These are unranked ordered finite trees whose every ...
Bisimulation provides structural conditions to characterize indistinguishability from an external ob...
International audienceThis is a survey on the satisfiability problem for XPath on data trees. Data t...
International audienceWe study FO(MTC), first-order logic with monadic transitive closure, a logical...
International audienceMotivated by reasoning tasks in the context of XML languages, the satisfiabili...
We present an algorithm to solve XPath decision problems under regular tree type constraints and sho...
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constrain...
A data tree is a tree whose every node carries a label from a finite alphabet and a datum from some ...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We investigate model theoretic properties of XPath with data (in)equality tests over the class of da...
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equa...
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equa...
We investigate the proof theory of a modal fragment of XPath equipped with data (in)equality tests o...
We give sound and complete axiomatizations for XPath with data tests by ‘equality’ or ‘inequality’, ...
We study a logic on multi-attribute data trees. These are unranked ordered finite trees whose every ...
Bisimulation provides structural conditions to characterize indistinguishability from an external ob...
International audienceThis is a survey on the satisfiability problem for XPath on data trees. Data t...
International audienceWe study FO(MTC), first-order logic with monadic transitive closure, a logical...
International audienceMotivated by reasoning tasks in the context of XML languages, the satisfiabili...
We present an algorithm to solve XPath decision problems under regular tree type constraints and sho...
In this paper we introduce sound and strongly complete axiomatizations for XPath with data constrain...
A data tree is a tree whose every node carries a label from a finite alphabet and a datum from some ...