Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
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…
cs.LO2025
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…
cs.LO2024
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…