Axiomatizing the Logical Core of XPath 2.0

Authors:
Balder ten Cate;Maarten Marx
Affiliations:
Universiteit van Amsterdam, ISLA–Informatics Institute, Kruislaan 403, 1098SJ, Amsterdam, The Netherlands;Universiteit van Amsterdam, ISLA–Informatics Institute, Kruislaan 403, 1098SJ, Amsterdam, The Netherlands
Venue:
Theory of Computing Systems
Year:
2009

Citing 0
Cited 4

On the Termination Problem for Declarative XML Message Processing

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
SXPath: extending XPath towards spatial querying on web documents

Proceedings of the VLDB Endowment
Foundations of XML based on logic and automata: a snapshot

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Optimising XML---RDF data integration: a formal approach to improve XSPARQL efficiency

ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications

Quantified Score

Hi-index	0.00

Visualization

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).