北京航空航天大学学报 ›› 1998, Vol. 24 ›› Issue (4): 391-394.

• 论文 • 上一篇    下一篇

非单调语义网络中继承的信任理论

马殿富   

  1. 北京航空航天大学 计算机科学与工程系
  • 收稿日期:1998-05-08 出版日期:1998-04-30 发布日期:2010-09-29
  • 作者简介:男 38岁 副教授 100083 北京
  • 基金资助:

    非单调语义网络中继承的信任理论

Confidential Theory of Inheritance in Nonmonotonic Semantic Network

Ma Dianfu   

  1. Beijing University of Aeronautics and Astronautics,Dept. of Computer Science and Engineering
  • Received:1998-05-08 Online:1998-04-30 Published:2010-09-29

摘要: 描述了一种新的具有例外的多继承语义网络推理方法——继承的信任理论,这是一种很具有吸引力的可废止继承方法.它应用于非循环语义网络的继承的分析,能够产生适合于继承直觉的非多义性结论.文中还讨论了Etherington的基于缺省逻辑的继承理论,提出了继承信任理论和继承信任缺省逻辑.给出了继承信任逻辑的性质,并且证明了构造继承信任缺省逻辑理论的唯一扩张是递推过程.信任理论的扩张能够快速求解.这种快速推理算法可以应用于专家系统推理.

Abstract: The confidential theory describes a new approach to inheritance reasoning in nonmonotonic semantic network allowing for multiple inheritance with exceptions. The approach leads to an analysis of defeasible inheritance that is well-defined and intuitively attractive. It yields unambiguous results applied to any acyclic semantic network.Etherington's default logic of inheritance is discussed. It provides a new confidential default logic of inheritance,describes properties of confidential default logic which has unique extension. The process of strutting unique extension is recurrence. The extension of confidential theory can compute quickly. These fast inference algorithms are applicable to expert system.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发