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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Areces, C., Carreiro, F., Figueira, S.: Characterization, definability and separation via saturated models. In: Theoretical Computer Science (to appear, 2014)
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press (2001)
Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. Journal of the ACM 56(3), 1–48 (2009)
Chang, C.C., Keisler, H.J.: Model theory. Studies in logic and the foundations of mathematics. North-Holland (1990)
Clark, J., DeRose, S.: XML path language (XPath). Website (1999), W3C Recommendation, http://www.w3.org/TR/xpath
De Rijke, M.: Modal model theory. Annals of Pure and Applied Logic (1995)
De Rijke, M., Sturm, H.: Global definability in basic modal logic. Essays on Non-Classical Logic 1, 111 (2001)
Figueira, D., Figueira, S., Areces, C.: Basic model theory of XPath on data trees. In: ICDT, pp. 50–60 (2014)
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems 30(2), 444–491 (2005)
Gyssens, M., Paredaens, J., Van Gucht, D., Fletcher, G.H.L.: Structural characterizations of the semantics of XPath as navigation tool on a document. In: PODS, pp. 318–327. ACM (2006)
Kurtonina, N., de Rijke, M.: Bisimulations for temporal logic. Journal of Logic, Language and Information 6, 403–425 (1997)
Kurtonina, N., de Rijke, M.: Simulating without negation. Journal of Logic and Computation 7, 503–524 (1997)
Marx, M., de Rijke, B.: Semantic characterizations of navigational XPath. SIGMOD Record 34(2), 41–46 (2005)
ten Cate, B.: The expressivity of XPath with transitive closure. In: Vansummeren, S. (ed.) PODS, pp. 328–337. ACM (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abriola, S., Descotte, M.E., Figueira, S. (2014). Definability for Downward and Vertical XPath on Data Trees. In: Kohlenbach, U., Barceló, P., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2014. Lecture Notes in Computer Science, vol 8652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44145-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-44145-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44144-2
Online ISBN: 978-3-662-44145-9
eBook Packages: Computer ScienceComputer Science (R0)