Satisfiability of XPath on data trees

Abstract : This is a survey on the satisfiability problem for XPath on data trees. Data trees are finite trees whose every node carries a label from a finite alphabet and a data value from an infinite domain. XPath is an expressive node selecting language for XML documents, which can be abstracted as data trees. Its satisfiability problem is in general undecidable. However, various fragments of XPath have decidable satisfiability problem, these are fragments defined in terms of the navigational axes which are allowed. We explore the state of the art in terms of decidability and discuss briefly some of the algorithmic techniques involved.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01670363
Contributeur : Diego Figueira <>
Soumis le : vendredi 23 mars 2018 - 13:39:37
Dernière modification le : jeudi 24 mai 2018 - 10:54:03

Fichier

survey.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Diego Figueira. Satisfiability of XPath on data trees. ACM SIGLOG News, ACM, 2018, 5 (2), pp.4-16. 〈http://doi.acm.org/10.1145/3212019.3212021〉. 〈10.1145/3212019.3212021〉. 〈hal-01670363v2〉

Partager

Métriques

Consultations de la notice

133

Téléchargements de fichiers

63