Weak Inclusion for Recursive XML Types

Abstract : Considering that the unranked tree languages L(G) and L(G') are those defined by given possibly-recursive XML types G and G' , this paper proposes a method to verify whether L(G) is "approximatively" included in L(G'). The approximation consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
Type de document :
Communication dans un congrès
CIAA - 2012, Jul 2012, Porto, Portugal. Springer, 7381, pp.78-89, 2012, LNCS
Liste complète des métadonnées

https://hal.inria.fr/hal-00701201
Contributeur : Pierre Réty <>
Soumis le : jeudi 24 mai 2012 - 17:17:13
Dernière modification le : mercredi 29 novembre 2017 - 10:19:28

Identifiants

  • HAL Id : hal-00701201, version 1

Collections

Citation

Pierre Réty, Jacques Chabin, Joshua Amavi. Weak Inclusion for Recursive XML Types. CIAA - 2012, Jul 2012, Porto, Portugal. Springer, 7381, pp.78-89, 2012, LNCS. 〈hal-00701201〉

Partager

Métriques

Consultations de la notice

80