Bounded repairability for regular tree languages

    ICDT, pp. 155-168, 2012.

    Cited by: 8|Bibtex|Views9|Links
    EI
    Keywords:
    specifications runranked treeanalogous problembounded repairabilityrestriction specification rMore(10+)

    Abstract:

    We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given target specification T. Specifically, we focus on the question of whether one can get from any tree in a regular language R to some tree in another regular language T...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments