55 citations · 205 across the 30 of their papers we have counts for
11 papers · 1 filter
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…
Advances in Logic-Based Entity Resolution: Enhancing ASPEN with Local Merges and Optimality Criteria
Zhliang Xiang, Meghyn Bienvenu, Gianluca Cima +2
In this paper, we present ASPEN+, which extends an existing ASP-based system, ASPEN,for collective entity resolution with two important functionalities: support for local merges an…
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…
ASPEN: ASP-Based System for Collective Entity Resolution
Zhiliang Xiang, Meghyn Bienvenu, Gianluca Cima +2
In this paper, we present ASPEN, an answer set programming (ASP) implementation of a recently proposed declarative framework for collective entity resolution (ER). While an ASP enc…
When is Shapley Value Computation a Matter of Counting?
Meghyn Bienvenu, Diego Figueira, Pierre Lafourcade
The Shapley value provides a natural means of quantifying the contributions of facts to database query answers. In this work, we seek to broaden our understanding of Shapley value…
Inconsistency Handling in Prioritized Databases with Universal Constraints: Complexity Analysis and Links with Active Integrity Constraints
Meghyn Bienvenu, Camille Bourgaux
This paper revisits the problem of repairing and querying inconsistent databases equipped with universal constraints. We adopt symmetric difference repairs, in which both deletions…
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +3
Our concern is the overhead of answering OWL 2 QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and bounded tre…
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151)
Serge Abiteboul, Marcelo Arenas, Pablo Barceló +18
In April 2016, a community of researchers working in the area of Principles of Data Management (PDM) joined in a workshop at the Dagstuhl Castle in Germany. The workshop was organi…
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +2
We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language OWL 2 QL: the succinctness problem for first-order…
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP
Meghyn Bienvenu, Balder ten Cate, Carsten Lutz +1
Ontology-based data access is concerned with querying incomplete data sources in the presence of domain-specific knowledge provided by an ontology. A central notion in this setting…