Preferential Semantics for Plausible Subsumption in Possibility Theory

Handling exceptions in a knowledge-based system has been considered as an important issue in many domains of applications, such as medical domain. In this paper, we propose several preferential semantics for plausible subsumption to deal with exceptions in description logic-based knowledge bases. Our preferential semantics are defined in the framework of possibility theory, which is an uncertainty theory devoted to the handling of incomplete information. We consider the properties of these semantics and their relationship. Entailment of these plausible subsumption relative to a knowledge base is also considered. We show the close relationship between two of our semantics and the mutually dual preferential semantics given by Britz, Heidema and Meyer. Finally, we show that our semantics for plausible subsumption can be reduced to standard semantics of an expressive description logic. Thus, the problem of plausible subsumption checking under our semantics can be reduced to the problem o...

• Type: Conference
• Year: 2010
• Where: KR
• Authors: Guilin Qi, Zhizheng Zhang
• Keywords: Automated Reasoning, KR 2010, Plausible Subsumption, Preferential Semantics, Semantics