Preferential Semantics for Plausible Subsumption in Possibility Theory

  • Authors:

  • Guilin Qi;Zhizheng Zhang

  • Affiliations:

  • Key Laboratory of Computer Network and Information Integration of State Education Ministry, School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China 211189 and State K ...;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China 211189 and Provincial Key Laboratory for Computer Information Processing Technology, Suzhou University, Suzhou ...

  • Venue:
  • Minds and Machines
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Handling exceptions in a knowledge-based system is an important issue in many application domains, such as medical domain. Recently, there is an increasing interest in nonmonotonic extension of description logics to handle exceptions in ontologies. In this paper, we propose three 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 handling incomplete information. We consider the properties of these semantics and their relationships. We also discuss the relationship between two of our preferential semantics and two existing preferential semantics. We extend a description logic-based knowledge base by adding preferential subsumptions. Entailment of plausible subsumptions relative to an extended knowledge base is defined. Properties of the preferential subsumption relations relative to an extended description logic-based knowledge base are discussed. 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 of subsumption checking under the classical semantics.