Preferential Semantics for Plausible Subsumption in Possibility Theory

被引:0
作者
Guilin Qi
Zhizheng Zhang
机构
[1] Southeast University,Key Laboratory of Computer Network and Information Integration of State Education Ministry, School of Computer Science and Engineering
[2] Nanjing University,State Key Laboratory for Novel Software Technology
[3] Southeast University,School of Computer Science and Engineering
[4] Suzhou University,Provincial Key Laboratory for Computer Information Processing Technology
来源
Minds and Machines | 2013年 / 23卷
关键词
Nonmonotonic reasoning; Uncertainty; Description logics; Possibility theory;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:47 / 75
页数:28
相关论文
共 31 条
[1]  
Baader F.(1995)Embedding defaults into terminological knowledge representation formalisms Journal of Automated Reasoning 14 149-180
[2]  
Hollunder B.(1995)Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic Journal of Automated Reasoning 15 41-68
[3]  
Baader F.(1997)Nonmonotonic reasoning, conditional objects and possibility theory Artificial Intelligence 92 259-276
[4]  
Hollunder B.(1998)Practical handling of exception-tainted rules and independence information in possibilistic logic Applied Intelligence 9 101-127
[5]  
Benferhat S.(2002)Description logics of minimal knowledge and negation as failure ACM Transactions on Computational Logic 3 177-225
[6]  
Dubois D.(2001)Plausibility measures and default reasoning Journal of ACM 48 648-685
[7]  
Prade H.(2009)ALC+T: A preferential extension of description logics Fundamenta Informaticae 96 341-372
[8]  
Benferhat S.(1990)Nonmonotonic reasoning, preferential models and cumulative logics Artificial Intelligence 44 167-207
[9]  
Dubois D.(1992)What does a conditional knowledge base entail? Artificial Intelligence 55 1-60
[10]  
Prade H.(2011)Extending description logics with uncertainty reasoning in possibilistic logic International Journal of Intelligent Systems 26 353-381