Abstract
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex counting conditions and data joins are not supported, as they lead to undecidability). The second aim is to provide a list of equations completely axiomatizing query equivalence in this language (i.e., all other query equivalences can be derived from these). © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Ten Cate, B., & Marx, M. (2006). Axiomatizing the logical core of XPath 2.0. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4353 LNCS, pp. 134–148). https://doi.org/10.1007/11965893_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
