id: 05934377
dt: a
an: 05934377
au: Amavi, Joshua; Chabin, Jacques; Halfeld Ferrari, Mirian; Réty, Pierre
ti: Weak inclusion for XML types.
so: Bouchou-Markhoff, Béatrice (ed.) et al., Implementation and application of
    automata. 16th international conference, CIAA 2011, Blois, France, July
    13‒16, 2011. Proceedings. Berlin: Springer (ISBN
    978-3-642-22255-9/pbk). Lecture Notes in Computer Science 6807, 30-41
    (2011).
py: 2011
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-22256-6_4
ab: Summary: Considering that the unranked tree languages $L(G)$ and
    $L(G^{\prime})$ are those defined by given non-recursive XML types $G$
    and $G^{\prime}$, this paper proposes a simple and intuitive method to
    verify whether $L(G)$ is “approximatively” included in
    $L(G^{\prime})$. Our approximative criterion consists in weakening the
    father-children relationships. Experimental results are discussed,
    showing the efficiency of our method in many situations.
rv: