6 papers
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…
Analysing Temporal Reasoning in Description Logics Using Formal Grammars
Camille Bourgaux, Anton Gnatenko, Michaël Thomazo
We establish a correspondence between (fragments of) , a temporal extension of the description logic with the LTL operator , and…
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,…
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…