On the Relationship between Shy and Warded Datalog+/-
This work addresses the need for understanding and comparing tractable fragments of Datalog^E to support query answering in knowledge graph applications, but it is incremental as it builds on existing fragments and systems.
The paper investigates the relationship between Shy and Warded Datalog+/- fragments, which are tractable extensions of Datalog with existential quantification used for knowledge graphs, and provides an experimental analysis comparing their implementations DLV^E and Vadalog.
Datalog^E is the extension of Datalog with existential quantification. While its high expressive power, underpinned by a simple syntax and the support for full recursion, renders it particularly suitable for modern applications on knowledge graphs, query answering (QA) over such language is known to be undecidable in general. For this reason, different fragments have emerged, introducing syntactic limitations to Datalog^E that strike a balance between its expressive power and the computational complexity of QA, to achieve decidability. In this short paper, we focus on two promising tractable candidates, namely Shy and Warded Datalog+/-. Reacting to an explicit interest from the community, we shed light on the relationship between these fragments. Moreover, we carry out an experimental analysis of the systems implementing Shy and Warded, respectively DLV^E and Vadalog.