论文标题
查询和修复不一致的优先知识基础：复杂性分析以及与抽象论证的联系
Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation
论文作者
论文摘要
在本文中，我们探讨了对优先知识基础（KB）的不一致处理的问题，该问题由本体论，一组事实和相互矛盾的事实之间的优先关系组成。在数据库设置中，已经研究了一个紧密相关的方案，并导致了优先级不一致的数据库的三种不同最佳维修（全局，帕累托和完成）的定义。在转移了我们设置的全球，帕累托和完美的修复概念之后，我们研究了核心推理任务的数据复杂性：基于最佳修复，存在独特的最佳修复和所有最佳再生的概述，在不满意的耐耐受性语义下进行查询。我们的结果几乎完整地描绘了这些任务的数据复杂性，用于在通用DL-Lite方言中提出的本体。我们工作的第二个贡献是阐明（基于集合的）论证框架的最佳维修与不同扩展概念之间的关系。在我们的结果中，我们表明，帕累托最佳维修精确地对应于稳定的扩展（通常也与首选的扩展）相对应，并且我们为优先的KBS提出了一种新的语义，该语义受到接地扩展的启发，并享有有利的计算特性。我们的研究还产生了有关基于偏好的论证框架的独立兴趣的一些结果。
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 of the core reasoning tasks: query entailment under inconsistency-tolerant semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs. Our results provide a nearly complete picture of the data complexity of these tasks for ontologies formulated in common DL-Lite dialects. The second contribution of our work is to clarify the relationship between optimal repairs and different notions of extensions for (set-based) argumentation frameworks. Among our results, we show that Pareto-optimal repairs correspond precisely to stable extensions (and often also to preferred extensions), and we propose a novel semantics for prioritized KBs which is inspired by grounded extensions and enjoys favourable computational properties. Our study also yields some results of independent interest concerning preference-based argumentation frameworks.
