Measuring Inconsistency in DL-Lite Ontologies

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. O...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 Ročník 1; s. 349 - 356
Hlavní autoři: Zhou, Liping, Huang, Houkuan, Qi, Guilin, Ma, Yue, Huang, Zhisheng, Qu, Youli
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 15.09.2009
IEEE
Edice:ACM Conferences
Témata:
Automatic logic units
Computational complexity
Computer science
Computing methodologies > Artificial intelligence > Knowledge representation and reasoning
Computing methodologies > Artificial intelligence > Knowledge representation and reasoning > Semantic networks
Computing methodologies > Machine learning > Machine learning approaches > Rule learning
Computing methodologies > Modeling and simulation > Model development and analysis
Computing methodologies > Modeling and simulation > Model development and analysis > Model verification and validation
Conferences
Debugging
DL-Lite
Inconsistency Degree
Intelligent agent
Measuring
Merging
Ontologies
Proposals
Time measurement
Inconsistency Degree
DL-Lite
ontologies
Measuring
ISBN:0769538010, 9780769538013
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:0769538010
9780769538013
DOI:10.1109/WI-IAT.2009.61