支持术语公理约束的扩展模糊描述逻辑推理
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60373066, 90412003 (国家自然科学基金); the National Natural Science Funds for Distinguished Young Scholar of China under Grant No.60425206 (国家杰出青年科学基金); the National Basic Research Program of China under Grant No.2002CB312000 (国家重点基础研究发展计划(973)); the High Technology Research Project of Jiangsu Province of China under Grant No.BG2005032 (江苏省高技术研究项目)


Reasoning Within Extended Fuzzy Description Logic Supporting Terminological Axiom Restrictions
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    扩展模糊描述逻辑是对描述逻辑的一种模糊扩展,支持对复杂模糊知识的表示和推理,但该逻辑缺乏支持术语公理约束的推理算法.提出扩展模糊描述逻辑EFALCR+(extended fuzzy attributive concept description language with complements and transitive roles)的受限TBox(terminological box)描述术语公理,给出受限TBox约束下的EFALCR+推理算法,并对该算法进行优化,证明优化后的算法是正确完备的,时间复杂性不超过指数,最后证明受限TBox约束下的EFALCR+推理问题是指数时间完全问题.优化算法的最坏时间复杂性已达到该问题推理算法的复杂度下界,是实现术语公理约束下模糊知识库推理的有效算法.

    Abstract:

    Extended fuzzy description logics are fuzzy extensions of description logics, which support representation and reasoning for expressive fuzzy knowledge. But they lack reasoning algorithms with the terminology axioms. This paper defines restricted TBoxes (terminological boxes) to describe terminology axioms in EFALCR+(extended fuzzy attributive concept description language with complements and transitive roles), proposes and optimizes reasoning algorithms for EFALCR+ with respect to restricted TBoxes. The optimized reasoning algorithm is proved sound, complete and with a worst complexity of exponential time. Its complexity has reached the lower bound, since the reasoning problem for EFALCR+ with respect to restricted TBoxes is proved exponential time complete. So it is an efficient algorithm of reasoning for fuzzy knowledge bases with terminology axioms.

    参考文献
    相似文献
    引证文献
引用本文

康达周,徐宝文,陆建江,李言辉.支持术语公理约束的扩展模糊描述逻辑推理.软件学报,2007,18(7):1563-1572

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2005-12-19
  • 最后修改日期:2006-07-26
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号