15 papers
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…
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…
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…
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…