A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments
2022
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning
unpublished
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
doi:10.24963/kr.2022/54
fatcat:lclduwguafhwlpnscbbnapqkfa