用ASP混合知识库提升元建模查询效率，解决语义不一致问题。
Efficient OWL2QL Meta-reasoning Using ASP-based Hybrid Knowledge Bases
- 基于ASP构建混合知识库，将元建模查询转为可高效求解的形式。
- 理论优化减少冗余计算，在测试中表现优于早期方法。
- 适合需高精度元建模的复杂系统建模者使用。
元建模指在本体中允许类和关系作为类的成员或出现在关系中，这在多个应用中具有价值，但无限制使用会导致不可判定性。现有实用语言要么显式禁止元建模，要么将类实例化为语义上不同的对象，从而无法真正支持元建模。已有若干扩展尝试部分实现该功能。本文基于前期工作，将元建模查询求解归约为对混合知识库的查询求解，仅在必要时使用Datalog转换。此前研究已验证该方法可行性，但性能提升未达预期。本文进一步优化了归约的理论基础，并引入替代工具，实现了更具竞争力的性能表现。
原文摘要 · Abstract (English)
Metamodeling refers to scenarios in ontologies in which classes and roles can be members of classes or occur in roles. This is a desirable modelling feature in several applications, but allowing it without restrictions is problematic for several reasons, mainly because it causes undecidability. Therefore, practical languages either forbid metamodeling explicitly or treat occurrences of classes as instances to be semantically different from other occurrences, thereby not allowing metamodeling semantically. Several extensions have been proposed to provide metamodeling to some extent. Building on earlier work that reduces metamodeling query answering to Datalog query answering, recently reductions to query answering over hybrid knowledge bases were proposed with the aim of using the Datalog transformation only where necessary. Preliminary work showed that the approach works, but the hoped-for performance improvements were not observed yet. In this work we expand on this body of work by improving the theoretical basis of the reductions and by using alternative tools that show competitive performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。