[2202.07980] Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Logic in Computer Science arXiv:2202.07980 (cs) [Submitted on 16 Feb 2022 ( v1 ), last revised 30 Apr 2026 (this version, v5)] Title: Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments Authors: Meghyn Bienvenu , Camille Bourgaux View a PDF of the paper titled Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments, by Meghyn Bienvenu and 1 other authors View PDF 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. 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 Subjects: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI); Databases (cs.DB) Cite as: arXiv:2202.07980 [cs.LO] (or arXiv:2202.07980v5 [cs.LO] for this version) https://doi.org/10.48550/arXiv.2202.07980 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Camille Bourgaux [ view email ] [v1] Wed, 16 Feb 2022 10:44:39 UTC (161 KB) [v2] Thu, 5 May 2022 07:13:08 UTC (2,168 KB) [v3] Tue, 28 Oct 2025 11:48:36 UTC (163 KB) [v4] Wed, 22 Apr 2026 13:01:03 UTC (160 KB) [v5] Thu, 30 Apr 2026 07:35:49 UTC (160 KB) Full-text links: Access Paper: View a PDF of the paper titled Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments, by Meghyn Bienvenu and 1 other authors View PDF TeX Source view license Current browse context: cs.LO < prev | next > new | recent | 2022-02 Change to browse by: cs cs.AI cs.DB References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from