当前位置: X-MOL 学术Artif. Intell. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On Quasi-Inconsistency and its Complexity
Artificial Intelligence ( IF 14.4 ) Pub Date : 2020-07-01 , DOI: 10.1016/j.artint.2020.103276
Carl Corea , Matthias Thimm

Abstract We address the issue of analyzing potential inconsistencies in knowledge bases. This refers to knowledge bases that contain rules which will always be activated together, and the knowledge base will become inconsistent, should these rules be activated. We investigate this problem in the context of the industrial use-case of business rule management, where it is often required that sets of (only) rules are analyzed for potential inconsistencies, e.g., during business rule modelling. To this aim, we introduce the notion of quasi-inconsistency, which is a formalization of the above-mentioned problem of potential inconsistencies. We put a specific focus on the analysis of computational complexity of some involved problems and show that many of them are intractable.

中文翻译:

关于准不一致性及其复杂性

摘要 我们解决了分析知识库中潜在不一致的问题。这是指知识库中包含的规则总是一起被激活,如果这些规则被激活,知识库将变得不一致。我们在业务规则管理的工业用例的背景下研究这个问题,其中通常需要分析(仅)规则集以寻找潜在的不一致,例如,在业务规则建模期间。为此,我们引入了准不一致的概念,它是上述潜在不一致问题的形式化。我们特别关注一些涉及问题的计算复杂性的分析,并表明其中许多是棘手的。
更新日期:2020-07-01
down
wechat
bug