IMAS 23417
INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Unidad Ejecutora - UE
artículos
Título:
Definability for Downward and Vertical XPath on Data Trees
Autor/es:
SERGIO ABRIOLA; MARÍA EMILIA DESCOTTE; SANTIAGO FIGUEIRA
Revista:
LECTURE NOTES IN COMPUTER SCIENCE
Editorial:
Springer
Referencias:
Año: 2014 vol. 8652 p. 20 - 35
ISSN:
0302-9743
Resumen:
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.
