38 citations · 99 across the 20 of their papers we have counts for
5 papers · 1 filter
Resilience for Regular Path Queries: Towards a Complexity Classification
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija +2
The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we…
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
Antoine Amarilli, Marcelo Arenas, YooJung Choi +3
This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of…
The Non-Cancelling Intersections Conjecture
Antoine Amarilli, Mikaël Monet, Dan Suciu
In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture inform…
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…
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
Pratik Karmakar, Mikaël Monet, Pierre Senellart +1
Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, a…