基于代价的不一致加权知识库查询语义
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases
AI总结：
本文针对含公理与断言权重的不一致描述逻辑知识库，定义基于代价的确定、可能答案概念，分析了ELbot至ALCO各类描述逻辑中相关问题的组合与数据复杂度。
摘要：
本文探究一种量化方法，用于查询不一致的描述逻辑知识库。所考虑的加权知识库中，公理和断言均具有（可能为无限的）权重，这些权重会依据解释违反的公理与断言，为每个解释分配代价。通过考虑代价不超过给定界限的解释，或聚焦于最优代价解释，定义了确定答案与可能答案两种概念。主要贡献是对从ELbot到ALCO的各类描述逻辑，分析了有界代价可满足性及确定、可能答案识别的组合复杂度与数据复杂度。
英文摘要：
In this paper, we explore a quantitative approach to querying inconsistent description logic knowledge bases. We consider weighted knowledge bases in which both axioms and assertions have (possibly infinite) weights, which are used to assign a cost to each interpretation based upon the axioms and assertions it violates. Two notions of certain and possible answer are defined by either considering interpretations whose cost does not exceed a given bound or restricting attention to optimal-cost interpretations. Our main contribution is a comprehensive analysis of the combined and data complexity of bounded cost satisfiability and certain and possible answer recognition, for description logics between ELbot and ALCO.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
