2011 | OriginalPaper | Chapter
Weak Inclusion for XML Types
Authors : Joshua Amavi, Jacques Chabin, Mirian Halfeld Ferrari, Pierre Réty
Published in: Implementation and Application of Automata
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.