2013/10/04 by André Frochaux, Frochaux, André, Nicole Schweikardt +1
Computer Science · #Advanced Database Systems and Queries #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.DB #cs.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1310.1316
arxiv created 2013/10/04 · openalex publication_date 2013/10/04 · arxiv updated 2013/10/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the article 'Recursive queries on trees and data trees' (ICDT'13), Abiteboul et al., asked whether the containment problem for monadic datalog over unordered unranked labeled trees using the child relation and the descendant relation is decidable. This note gives a positive answer to this question, as well as an overview of the relative expressive power of monadic datalog on various representations of unranked trees.