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

Littérature citée [55 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01670363
Contributeur : Diego Figueira <>
Soumis le : jeudi 21 décembre 2017 - 12:43:15
Dernière modification le : jeudi 11 janvier 2018 - 06:27:34

Fichier

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

Identifiants

  • HAL Id : hal-01670363, version 1

Collections

Citation

Diego Figueira. Satisfiability of XPath on data trees. 2017. 〈hal-01670363〉

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

21