Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments

ArXi:2202.07980v4 Announce Type: replace-cross 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 relation between conflicting facts. We consider three well-known semantics (AR, IAR and brave) based upon two notions of optimal repairs (Pareto and completion