AINeutralarXiv – CS AI · 15h ago5/10
🧠
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
This academic paper addresses inconsistency handling in prioritized knowledge bases by analyzing the computational complexity of query entailment and repair enumeration under three optimal repair notions (global, Pareto, completion). The work establishes formal connections between optimal repairs and argumentation theory extensions, offering theoretical foundations for knowledge base consistency management.