揭示加权知识库与条件表示在语义上的等价性，为不一致数据查询提供新视角。
Semantic Bridges Between First Order c-Representations and Cost-Based Semantics: An Initial Perspective
- 通过代价函数统一两类非单调推理方法的解释排序机制
- 证明在特定条件下二者对解释的排序完全一致
- 适用于知识融合与不一致数据推理的研究者
加权知识库与基于代价的语义是Bienvenu等人提出的一种新形式化框架，用于处理不一致知识库下的本体中介数据查询。该方法为知识库中的每条陈述赋予权重，并根据解释违背规则的频率为其分配代价。本文将此方法与Kern-Isberner提出的c-表示进行比较，后者是一种用于一阶情况下可反驳条件包含的非单调推理形式。通过为每个解释分配因违反条件而产生的惩罚值来实现数值排名。研究发现，在特定条件下，加权知识库与一组可反驳条件可生成相同的解释排序，从而实现语义结构在相对代价意义上的等价。此外，两种形式下蕴含关系的部分概念可相互表达。研究成果有助于推动代价语义与c-表示的进一步发展。
原文摘要 · Abstract (English)
Weighted-knowledge bases and cost-based semantics represent a recent formalism introduced by Bienvenu et al. for Ontology Mediated Data Querying in the case where a given knowledge base is inconsistent. This is done by adding a weight to each statement in the knowledge base (KB), and then giving each DL interpretation a cost based on how often it breaks rules in the KB. In this paper we compare this approach with c-representations, a form of non-monotonic reasoning originally introduced by Kern-Isberner. c-Representations describe a means to interpret defeasible concept inclusions in the first-order case. This is done by assigning a numerical ranking to each interpretations via penalties for each violated conditional. We compare these two approaches on a semantic level. In particular, we show that under certain conditions a weighted knowledge base and a set of defeasible conditionals can generate the same ordering on interpretations, and therefore an equivalence of semantic structures up to relative cost. Moreover, we compare entailment described in both cases, where certain notions are equivalently expressible in both formalisms. Our results have the potential to benefit further work on both cost-based semantics and c-representations
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。