Abstract
We study the expressive power of the downward and vertical fragments of XPath equipped with (in)equality tests over data trees. We give necessary and sufficient conditions for a class of pointed data trees to be definable by a set of formulas or by a single formula of each of the studied logics. To do so, we introduce a notion of saturation, and show that over saturated data trees bisimulation coincides with logical equivalence. © 2014 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Abriola, S., Descotte, M. E., & Figueira, S. (2014). Definability for downward and vertical XPath on data trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8652 LNCS, pp. 20–35). Springer Verlag. https://doi.org/10.1007/978-3-662-44145-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
