SROEL有理扩张中最小蕴涵的ASP
ASP for Minimal Entailment in a Rational Extension of SROEL
摘要:
在本文中,我们利用回答集编程(ASP)推理的合理扩展SROEL-R-T的低复杂度的描述逻辑SROEL,这是OWL EL本体语言的基础。在扩展语言中,典型性算子T被允许定义概念T(C)(典型的C)在一个合理的语义。它已被证明,合理蕴涵下的实例检查有一个多项式的复杂性。为了加强理性蕴涵,在本文中,我们考虑了最小模型语义。我们证明了,对于任意的SROEL-R-T知识库,在最小蕴涵下的实例检验是<$^P_2-完全的。依赖于一个小模型的结果,模型对应于一个合适的ASP编码的答案集,我们利用答案集偏好(特别是Asprin框架)推理下最小的蕴涵。本文正在考虑接受逻辑程序设计的理论与实践。
英文摘要:
In this paper we exploit Answer Set Programming (ASP) for reasoning in a rational extension SROEL-R-T of the low complexity description logic SROEL, which underlies the OWL EL ontology language. In the extended language, a typicality operator T is allowed to define concepts T(C) (typical C's) under a rational semantics. It has been proven that instance checking under rational entailment has a polynomial complexity. To strengthen rational entailment, in this paper we consider a minimal model semantics. We show that, for arbitrary SROEL-R-T knowledge bases, instance checking under minimal entailment is Π^P_2-complete. Relying on a Small Model result, where models correspond to answer sets of a suitable ASP encoding, we exploit Answer Set Preferences (and, in particular, the asprin framework) for reasoning under minimal entailment. The paper is under consideration for acceptance in Theory and Practice of Logic Programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。