Understanding the complexity of axiom pinpointing in lightweight description logics

作者:

摘要

Lightweight description logics are knowledge representation formalisms characterised by the low complexity of their standard reasoning tasks. They have been successfully employed for constructing large ontologies that model domain knowledge in several different practical applications. In order to maintain these ontologies, it is often necessary to detect the axioms that cause a given consequence. This task is commonly known as axiom pinpointing.

论文关键词:Description logics,Axiom pinpointing,Computational complexity,Counting complexity,Enumeration complexity

论文评审过程:Received 7 October 2016, Revised 9 June 2017, Accepted 12 June 2017, Available online 17 June 2017, Version of Record 29 June 2017.

论文官网地址:https://doi.org/10.1016/j.artint.2017.06.002