Inconsistency degree computation for possibilistic description logic: an extension of the tableau algorithm

Abstract : Possibilistic description logic (PDL) is an extension of description logic based on possibilistic logic: it provides a framework to formalise knowledge allowing to encompass, model and handle uncertain information. In this paper, we consider the problem of consistency checking for PDL and propose an algorithm to compute the inconsistency degree of knowledge bases in this framework. To that aim, we present an extension of the tableau algorithm: we introduce extensions of the clash definition and completion rules to take into account the certainty associated with each formula, providing an inference procedure handling degree of certainty.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01301601
Contributor : Lip6 Publications <>
Submitted on : Tuesday, April 12, 2016 - 3:07:37 PM
Last modification on : Thursday, March 21, 2019 - 1:09:13 PM

Identifiers

Citation

Marie-Jeanne Lesot, Olivier Couchariere, Bernadette Bouchon-Meunier, Jean-Luc Rogier. Inconsistency degree computation for possibilistic description logic: an extension of the tableau algorithm. 27th North American Fuzzy Information Processing Society Annual Conference (NAFIPS 2008), May 2008, New York, United States. pp.1-6, ⟨10.1109/NAFIPS.2008.4531240⟩. ⟨hal-01301601⟩

Share

Metrics

Record views

79