Axiomatizing the logical core of XPath 2.0
| Authors | |
|---|---|
| Publication date | 2009 |
| Journal | Theory of Computing Systems |
| Volume | Issue number | 44 | 4 |
| Pages (from-to) | 561-589 |
| Organisations |
|
| 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). |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1007/s00224-008-9151-9 |
| Downloads |
320593.pdf
(Final published version)
|
| Permalink to this page | |
