Appendix: description logic terminology
The description logic handbook
How to act on inconsistent news: ignore, resolve, or reject
Data & Knowledge Engineering
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Consistent query answering over description logic ontologies
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Measuring incoherence in description logic-based ontologies
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
A framework for handling inconsistency in changing ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Approaches to measuring inconsistent information
Inconsistency Tolerance
Measuring inconsistency through minimal proofs
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Measuring incompleteness under multi-valued semantics by partial MaxSAT solvers
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Paraconsistent query answering over DL-Lite ontologies
Web Intelligence and Agent Systems
| Hi-index | 0.00 |
Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches have been proposed to deal with this issue. However, the main drawback of these algorithms is their high computational complexity. One of the main sources of the high complexity is the intractability of the underlying Description Logics (DLs). In this paper, we focus on an important tractable DL family, \emph{DL-Lite}. We define an inconsistency degree of a \emph{DL-Lite} ontology based on a three-valued semantics. We also present an algorithm to compute this inconsistency degree and show that its time-complexity is PTime in the size of ABox and TBox.