38 citations
- Centre de Recherche en Informatique, Signal et Automatique de LilleFR2 papers
- Laboratoire d'Informatique Fondamentale de LilleFR2 papers
- Millennium InstituteBR2 papers
- Birkbeck, University of LondonGB1 paper
- Centre de Recherche en InformatiqueFR1 paper
- Centre Inria de l'Université de LilleFR1 paper
- Centre Inria de l'Université de LorraineFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Community LinkUS1 paper
- École Centrale de LilleFR1 paper
- Franche-Comté Électronique Mécanique Thermique et Optique - Sciences et TechnologiesFR1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
6 papers
The Shapley Value in Database Management
Leopoldo Bertossi, Benny Kimelfeld, Ester Livshits +1
Attribution scores can be applied in data management to quantify the contribution of individual items to conclusions from the data, as part of the explanation of what led to these…
Static Analysis of Graph Database Transformations
Iovka Boneva, Benoit Groz, Jan Hidders +2
We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental stat…
Model Interpretability through the Lens of Computational Complexity
Pablo Barceló, Mikaël Monet, Jorge Pérez +1
In spite of several claims stating that some models are more interpretable than others -- e.g., "linear models are more interpretable than deep neural networks" -- we still lack a…
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Pierre Bourhis, Carsten Lutz
We study query containment in three closely related formalisms: monadic disjunctive Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems), and onto…
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
P. -C Héam, V. Hugot, O. Kouchnarenko
The model of tree automata with equality and disequality constraints was introduced in 2007 by Filiot, Talbot and Tison. In this paper we show that if there is at least one disequa…
Query Containment for Highly Expressive Datalog Fragments
Pierre Bourhis, Markus Krötzsch, Sebastian Rudolph
The containment problem of Datalog queries is well known to be undecidable. There are, however, several Datalog fragments for which containment is known to be decidable, most notab…