199 citations · 396 across the 17 of their papers we have counts for
20 papers
On the Correspondence Between Monotonic Max-Sum GNNs and Datalog
David Tena Cucala, Bernardo Cuenca Grau, Boris Motik +1
Although there has been significant interest in applying machine learning techniques to structured data, the expressivity (i.e., a description of what can be learned) of such techn…
Rewriting the Infinite Chase
Michael Benedikt, Maxime Buron, Stefano Germano +2
Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answe…
Datalog Reasoning over Compressed RDF Knowledge Bases
Pan Hu, Jacopo Urbani, Boris Motik +1
Materialisation is often used in RDF systems as a preprocessing step to derive all facts implied by given RDF triples and rules. Although widely used, materialisation considers all…
Datalog Materialisation in Distributed RDF Stores with Dynamic Data Exchange
Temitope Ajileye, Boris Motik, Ian Horrocks
Several centralised RDF systems support datalog reasoning by precomputing and storing all logically implied triples using the wellknown seminaive algorithm. Large RDF datasets ofte…
Modular Materialisation of Datalog Programs
Pan Hu, Boris Motik, Ian Horrocks
The seminaïve algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the inp…
Stratified Negation in Limit Datalog Programs
Mark Kaminski, Bernardo Cuenca Grau, Egor V. Kostylev +2
There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation…