冲突度量：一个基于MUS-Decomposition的框架
On the measure of conflicts: A MUS-Decomposition Based Framework
摘要：
度量不一致性被视为与处理不一致性相关的重要问题。好的测度应该满足一组有理性质。然而，定义声音属性有时是有问题的。在本文中，我们强调这样一个属性，命名为分解，很少在文献中讨论，由于其建模困难。为此，我们提出了一个独立的分解，这是比现有的建议更直观。为了以更细粒度的方式分析不一致性，我们引入了知识库和各种MUSdecomposition的图形表示。一个特定的MUS-decomposition，命名为分布式MUS-decomposition导致一个有趣的分区的不一致的知识库，使多个专家可以检查不一致的并行，这是不可能的现有措施。这种特定的MUSdecomposition导致满足多个期望属性的不一致性度量。此外，我们给出了一个上界的复杂性的措施，可以计算使用0/1线性规划或最小成本可满足性问题，并进行初步的实验，以证明其可行性。
英文摘要：
Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining sound properties is sometimes problematic. In this paper, we emphasize one such property, named Decomposability, rarely discussed in the literature due to its modeling difficulties. To this end, we propose an independent decomposition which is more intuitive than existing proposals. To analyze inconsistency in a more fine-grained way, we introduce a graph representation of a knowledge base and various MUSdecompositions. One particular MUS-decomposition, named distributable MUS-decomposition leads to an interesting partition of inconsistencies in a knowledge base such that multiple experts can check inconsistencies in parallel, which is impossible under existing measures. Such particular MUSdecomposition results in an inconsistency measure that satisfies a number of desired properties. Moreover, we give an upper bound complexity of the measure that can be computed using 0/1 linear programming or Min Cost Satisfiability problems, and conduct preliminary experiments to show its feasibility.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
