Consistency checking for extended description logics

Abstract : In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We compare these two approaches and comment on their differences concentrating on the consistency issue of knowledge bases represented in these extended frameworks. We present a classification of existing algorithms and describe a new method for the possibilistic case that yields an inconsistency degree and not only a binary answer to the consistency question. The proposed algorithm is based on a direct extension of the tableau algorithm to the possibilistic case, for which we introduce appropriate clash and completion rule definitions.
Document type :
Conference papers
Complete list of metadatas
Contributor : Lip6 Publications <>
Submitted on : Tuesday, April 12, 2016 - 3:09:51 PM
Last modification on : Thursday, March 21, 2019 - 1:09:08 PM


  • HAL Id : hal-01301602, version 1


Olivier Couchariere, Marie-Jeanne Lesot, Bernadette Bouchon-Meunier. Consistency checking for extended description logics. The 21st International Workshop on Description Logics (DL 2008), May 2008, Dresden, Germany. ⟨hal-01301602⟩



Record views