Skip to Main content Skip to Navigation
Conference papers

Weak Inclusion for XML Types

Abstract : Considering that the unranked tree languages L(G) and L(G') are those defined by given non-recursive XML types G and G', this paper proposes a simple and intuitive method to verify whether L(G) is ''approximatively'' included in L(G'). Our approximative criterion consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
Document type :
Conference papers
Complete list of metadata
Contributor : Pierre Réty Connect in order to contact the contributor
Submitted on : Friday, May 20, 2011 - 9:07:08 AM
Last modification on : Saturday, June 25, 2022 - 10:11:28 AM


  • HAL Id : inria-00594520, version 1



Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari Alves, Pierre Réty. Weak Inclusion for XML Types. International Conference on Implementation and Application of Automata (CIAA), Jul 2011, Blois, France. pp.30-41. ⟨inria-00594520⟩



Record views