Abstract

This paper is about the W3C standard node-addressing language for XML documents, called XPath. XPath is still under development. Version 2.0 appeared in 2001 while the theoretical foundations of Version 1.0 (dating from 1998) are still being widely studied. The paper aims at bringing XPath to a "stable fixed point" in its development: a version which is expressively complete, still manageable computationally, with a user-friendly syntax and a natural semantics.

Citations

743	First-Order Dynamic Logic - Harel - 1997
698	Design and synthesis of synchronization skeletons using branching time temporal logic - Clarke, Emerson - 1981
307	A catalog of complexity classes - Johnson - 1990
221	Results on the propositional mu-calculus - Kozen - 1983
219	Efficient Algorithms for Processing XPath Queries - Gottlob, Koch, et al. - 2002
215	Tense Logic and the Theory of Linear Order - Kamp - 1968
212	On the temporal analysis of fairness - Gabbay, Pnueli, et al. - 1980
162	Fibring logics - Gabbay - 1999
157	Tree acceptors and some of their applications - Doner - 1970
137	Containment and equivalence for an XPath fragment - Miklau, Suciu - 2002
102	Decidability of second order theories and automata on infinite trees - Rabin - 1969
88	XPath containment in the presence of disjunction, DTDs, and variables - Neven, Schwentick - 2003
87	Kleene algebra with tests - Kozen - 1997
82	Data on the web - Abiteboul, Buneman, et al. - 2000
80	Structural properties of XPath fragments - Benedikt, Fan, et al. - 2005
80	Models of Program Logic - Pratt - 1979
79	The complexity of XPath query evaluation - Gottlob, Koch, et al. - 2003
62	Monadic queries over tree-structured data - Gottlob - 2002
50	Representing and reasoning on XML documents: a description logic approach - Calvanese, Giacomo, et al.
40	Two semantics for XPath - Wadler - 2000
30	Propositional dynamic logic of regular programs - Fisher, Ladner - 1979
21	Rijke. A modal perspective on path constraints - Alechina, Demri, et al.
17	Logical aspects in the study of tree languages - Thomas - 1984
15	A Descriptive Approach to Language Theoretic Complexity - ROGERS - 1998
13	Reachability Logic: An Efficient Fragment of Transitive Closure Logic - Alechina, Immerman
13	The complexity of translating logic to finite automata - Reinhardt
5	Variable free reasoning on finite trees - Blackburn, Gaiffe, et al. - 2003
5	Decidability of S1S and S2S - Weyer - 2002
2	The Grammatical Basis of Natural Languages - Berwick, Weinberg - 1984
1	XCPath, the expressively complete XPath fragment - Marx - 2003