Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
Abstract
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). Deciding whether a query answer holds under these semantics is (co)NP-complete in data complexity for a large class of logical theories, and SAT-based procedures have been devised for repair-based semantics when there is no priority relation, or the relation has a special structure. The present paper introduces the first SAT encodings for Pareto- and completion-optimal repairs w.r.t. general priority relations and proposes several ways of employing existing and new encodings to compute answers under (optimal) repair-based semantics, by exploiting different reasoning modes of SAT solvers. The comprehensive experimental evaluation of our implementation compares both (i) the impact of adopting semantics based on different kinds of repairs, and (ii) the relative performances of alternative procedures for the same semantics.
Cite
@article{arxiv.2202.07980,
title = {Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments},
author = {Meghyn Bienvenu and Camille Bourgaux},
journal= {arXiv preprint arXiv:2202.07980},
year = {2026}
}
Comments
This is an extended version of a paper appearing at the 19th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022). 121 pages. This version fixes an error in appendix B.3