研究如何在描述逻辑与逻辑编程中高效计算知识表示的插值
Interpolation in Knowledge Representation
- 提出在两类主流知识表示形式中计算插值的方法
- 解决插值存在性与可计算性的理论难题
- 适用于可解释性、遗忘与模块化等场景
Craig插值与统一插值在知识表示中有广泛应用，涵盖可解释性、遗忘、模块化与复用，甚至学习。然而，许多相关知识表示形式通常不具有Craig或统一插值性质，且实际计算插值极具挑战。本文深入探讨了两种重要知识表示形式——描述逻辑与逻辑编程，讨论其插值的理论结果与实用计算方法。
原文摘要 · Abstract (English)
Craig interpolation and uniform interpolation have many applications in knowledge representation, including explainability, forgetting, modularization and reuse, and even learning. At the same time, many relevant knowledge representation formalisms do in general not have Craig or uniform interpolation, and computing interpolants in practice is challenging. We have a closer look at two prominent knowledge representation formalisms, description logics and logic programming, and discuss theoretical results and practical methods for computing interpolants.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。