将理性闭包用于轻量描述逻辑，实现高效缺陷知识推理
Tractable Reasoning and Conjunctive Query Answering for Defeasible DL-Lite under Rational Closure
- 基于经典推理器构建插件架构，复用现有工具
- 在DL-Lite上实现可计算的理性闭包推理与连贯查询回答
- 适合需要处理可撤销规则的智能系统开发者
在描述逻辑中，理性闭包（RC）是一种被广泛接受的非单调形式化方法，用于处理缺陷知识。本文研究了理性闭包在轻量级描述逻辑家族DL-Lite的核心版和霍恩版中的应用。我们分析了在理性闭包下的授权性（实例检查）与合取查询（CQ）回答问题。主要贡献是提出一种插件式架构，基于现有的标准经典推理器，证明在DL-Lite上进行理性闭包的推理与合取查询回答可以高效完成，且计算开销极小。
原文摘要 · Abstract (English)
In Description Logics (DLs), reasoning under Rational Closure (RC) is a well-known and widely accepted non-monotonic formalism to handle defeasible knowledge. In this paper, we study the application of RC to the core and horn variants of the DL-Lite family of lightweight description logics. We analyze both entitlement (instance checking) and Conjunctive Query (CQ) answering under RC. Our main contribution is providing a plug-in architecture that builds upon existing standard classical reasoners, establishing that reasoning and CQ answering under RC for DL-Lite can be done efficiently with minimal computational overhead.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。