5 papers
How Hard is it to Decide if a Fact is Relevant to a Query?
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
We consider the following fundamental problem: given a database D, Boolean conjunctive query (CQ) q, and fact f in D, decide whether f is relevant to q wrt. D, i.e., does f belong…
Responsibility Measures for Conjunctive Queries with Negation
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
We contribute to the recent line of work on responsibility measures that quantify the contributions of database facts to obtaining a query result. In contrast to existing work whic…
Shapley Value Computation in Ontology-Mediated Query Answering
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
The Shapley value was originally introduced in cooperative game theory as a wealth distribution mechanism. It has since found use in knowledge representation and databases for the…
Shapley Revisited: Tractable Responsibility Measures for Query Answers
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
The Shapley value, originating from cooperative game theory, has been employed to define responsibility measures that quantify the contributions of database facts to obtaining a gi…
Tractable Responsibility Measures for Ontology-Mediated Query Answering
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
Recent work on quantitative approaches to explaining query answers employs responsibility measures to assign scores to facts in order to quantify their respective contributions to…