Eliminating Harmful Joins in Warded Datalog

• Published in: Rules and Reasoning Vol. 12851; pp. 267 - 275
• Main Authors: Baldazzi, Teodoro, Bellomarini, Luigi, Sallinger, Emanuel, Atzeni, Paolo
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2021; Springer International Publishing
• Series: Lecture Notes in Computer Science
• ISBN: 9783030911669; 3030911667
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-91167-6_18

We provide a rewriting technique of Warded Datalog+/− settings to sustain decidability and data tractability of reasoning tasks in the presence of existential quantification and recursion. To achieve this behaviour in practice, reasoners implement specialized strategies which exploit the theoretical bases of the language to control the effects of recursion, ensuring reasoning termination with small memory footprint. However, as a necessary condition for such exploitation, the setting is required to be in a “normalized form”, essentially without joins on variables affected by existential quantification. We present the Harmful Join Elimination, a normalization algorithm of Warded Datalog+/− that removes such “harmful” joins, supporting the tractability of the reasoning task as well as the full expressive power of the language. The algorithm is integrated in the Vadalog system, a Warded Datalog+/− -based reasoner that performs ontological reasoning in complex scenarios.