Monadic Datalog Containment on Trees Using the Descendant-Axis

    AMW, 2016.

    Cited by: 1|Bibtex|Views0|Links
    EI

    Abstract:

    In their AMW14-paper, Frochaux, Grohe, and Schweikardt showed that the query containment problem for monadic datalog on finite unranked labeled trees is Exptime-complete when (a) considering unordered trees using the child-axis, and when (b) considering ordered trees using the axes firstchild, nextsibling, and child. Furthermore, when all...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments