On XPath with Reflexive-Transitive Axes and Data Tests
Résumé
We study a logic on multi-attribute data trees. These are unranked ordered finite trees whose every node contains a label, and a vector of data values, one for each attribute. Labels belong to some finite alphabet, and data values to some infinite domain. Here, we show decidability of the satisfiability problem for XPath with data equality tests, where navigation can be done going downwards, rightwards or leftwards in the XML document. That is, where navigation is done using the reflexive-transitive XPath axes "descendant-or-self", "following-sibling-or-self", and "preceding-sibling-or-self".
Origine | Fichiers produits par l'(les) auteur(s) |
---|