Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
arXiv:2003.05746v5 Announce Type: replace-cross Abstract: In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity
This academic paper, published in 2026, details a foundational AI research concept without immediate real-world application.
For a strategic reader, this specific publication has minimal direct importance as it focuses on highly abstract AI consistency handling.
No immediate or foreseeable changes result from this incremental academic research in formal AI theory.
Further theoretical understanding of knowledge base inconsistency.
Potentially improved long-term robustness for highly complex AI systems.
No discernible third-order effects on markets, geopolitics, or general technology adoption.
This signal links to a primary source. Continuum Brief monitors and indexes it as part of the live intelligence stream — we do not republish source content.
Read at arXiv cs.AI