ABox Abduction in the Description Logic ALC\boldsymbol{\mathcal{ALC}}

详细信息

下载全文

推荐本文 |

• 作者：Szymon Klarman (1) sklarman@few.vu.nl
  Ulle Endriss (2) ulle.endriss@uva.nl
  Stefan Schlobach (1) schlobac@few.vu.nl
• 关键词：Description logic &#8211 ; Abduction &#8211 ; Non ; standard reasoning services &#8211 ; Semantic tableaux &#8211 ; Resolution
• 刊名：Journal of Automated Reasoning
• 出版时间：January 2011
• 出版年：2011
• 期刊代码：38_01687433
• 类别：ch
• 卷：46
• 期：1
• 页码：43-80
• 数据来源：sp

摘要

Due to the growing popularity of Description Logics-based knowledge representation systems, predominantly in the context of Semantic Web applications, there is a rising demand for tools offering non-standard reasoning services. One particularly interesting form of reasoning, both from the user as well as the ontology engineering perspective, is abduction. In this paper we introduce two novel reasoning calculi for solving ABox abduction problems in the Description Logic , i.e. problems of finding minimal sets of ABox axioms, which when added to the knowledge base enforce entailment of a requested set of assertions. The algorithms are based on regular connection tableaux and resolution with set-of-support and are proven to be sound and complete. We elaborate on a number of technical issues involved and discuss some practical aspects of reasoning with the methods.