55 citations · 205 across the 30 of their papers we have counts for
13 papers · 1 filter
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…
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…
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,…
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…
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…
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…
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…
Theoretically Optimal Datalog Rewritings for OWL 2 QL Ontology-Mediated Queries
Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov +2
We show that, for OWL 2 QL ontology-mediated queries with (i) ontologies of bounded depth and conjunctive queries of bounded treewidth, (ii) ontologies of bounded depth and bounded…
Nested Regular Path Queries in Description Logics
Meghyn Bienvenu, Diego Calvanese, Magdalena Ortiz +1
Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data. They a…
Prime Implicates and Prime Implicants: From Propositional to Modal Logic
Meghyn Bienvenu
Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose…