55 citations · 205 across the 30 of their papers we have counts for
32 papers
Answering Path Queries under Linear and Guarded Existential Rules
Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier +1
Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology. While most work in the…
Using ASP(Q) to Handle Inconsistent Prioritized Data
Meghyn Bienvenu, Camille Bourgaux, Robin Jean +1
We explore the use of answer set programming (ASP) and its extension with quantifiers, ASP(Q), for inconsistency-tolerant querying of prioritized data, where a priority relation be…
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…
Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications
Yvon K. Awuklu, Meghyn Bienvenu, Katsumi Inoue +2
In this paper, we develop a novel logic-based approach to detecting high-level temporally extended events from timestamped data and background knowledge. Our framework employs logi…
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…
Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics
Meghyn Bienvenu, Quentin Manière
In this paper, we study the data complexity of querying inconsistent weighted description logic (DL) knowledge bases under recently-introduced cost-based semantics. In a nutshell,…
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…
A Rule-Based Approach to Specifying Preferences over Conflicting Facts and Querying Inconsistent Knowledge Bases
Meghyn Bienvenu, Camille Bourgaux, Katsumi Inoue +1
Repair-based semantics have been extensively studied as a means of obtaining meaningful answers to queries posed over inconsistent knowledge bases (KBs). While several works have c…
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…
Inconsistency Handling in DatalogMTL
Meghyn Bienvenu, Camille Bourgaux, Atefe Khodadaditaghanaki
In this paper, we explore the issue of inconsistency handling in DatalogMTL, an extension of Datalog with metric temporal operators. Since facts are associated with time intervals,…
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…
Abductive Reasoning in a Paraconsistent Framework
Meghyn Bienvenu, Katsumi Inoue, Daniil Kozhemiachenko
We explore the problem of explaining observations starting from a classically inconsistent theory by adopting a paraconsistent framework. We consider two expansions of the well-kno…
Queries With Exact Truth Values in Paraconsistent Description Logics
Meghyn Bienvenu, Camille Bourgaux, Daniil Kozhemiachenko
We present a novel approach to querying classical inconsistent description logic (DL) knowledge bases by adopting a~paraconsistent semantics with the four Belnapian values: exactly…
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…
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
Meghyn Bienvenu, Camille Bourgaux, Robin Jean
In this paper, we explore a quantitative approach to querying inconsistent description logic knowledge bases. We consider weighted knowledge bases in which both axioms and assertio…
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…
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…
Combining Global and Local Merges in Logic-based Entity Resolution
Meghyn Bienvenu, Gianluca Cima, Víctor Gutiérrez-Basulto +1
In the recently proposed Lace framework for collective entity resolution, logical rules and constraints are used to identify pairs of entity references (e.g. author or paper ids) t…
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
Meghyn Bienvenu, Camille Bourgaux
We investigate practical algorithms for inconsistency-tolerant query answering over prioritized knowledge bases, which consist of a logical theory, a set of facts, and a priority r…
First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics
Meghyn Bienvenu, Peter Hansen, Carsten Lutz +1
We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment prob…
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
Meghyn Bienvenu, Camille Bourgaux
In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between…
Finite LTL Synthesis with Environment Assumptions and Quality Measures
Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith
In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is cen…
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…