描述逻辑εLN 循环术语集的不动点语义及推理
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.60663001, 60673135, 60373081, 60573010 (国家自然科学基金); the National Basic Research Program of China under Grant No.2003CB317004 (国家重点基础研究发展计划(973)); thePostdoctoral Science Foundation of China under Grant No.20060400226 (中国博士后科学基金); the Natural Science Key Foundation of Guangdong Province of China under Grant No.04105503 (广东省自然科学重点基金); the Program for New Century Excellent TalentsinUniversity of China (新世纪优秀人才支持计划); the Natural Science Foundation of Guangxi Province of China under GrantNos.0640030, 0832103 (广西自然科学基金)


Fixpoint Semantics and Reasoning of Terminological Cycles in Description Logic εLN
Author:
Affiliation:

Fund Project:

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

    循环术语集是描述逻辑长期以来的研究难点,其最基本的问题即语义及推理问题没有得到合理的解决.分析了描述逻辑循环术语集的研究现状和存在的问题,将Baader 的工作扩展到新的方向.针对更大的描述逻辑系统研究了循环术语集的语义及推理机制,即在描述逻辑εL 的基础上添加数量约束构造算子,提出了描述逻辑εLN,给出了εLN 的语义(包括不动点语义和描述语义).针对εLN 的需要,重新定义了描述图(包括语法描述图和语义描述图).使用描述图之间的模拟关系给出了不动点语义下εLN 循环术语集的可满足性和包含关系推理算法,并证明了推理算法是多项式时间复杂的.

    Abstract:

    Terminological cycles have been a very hard problem in description logics for a long time, and their essential problems, i.e. semantics and reasoning problems, have not been solved reasonably. Current research progress and the existing problems of terminological cycles in description logics are analyzed in this paper. Based on the work of Baader, a new direction in terminological cycles is put forward. Aiming at more expressive description logic, the semantics and reasoning mechanism of terminological cycles are studied. The number restrictions are added to description logic εL, and the descripion logic εLN is presented. The semantics (fixpoint semantics and descriptive semantics) of εLN are given. To meet the requirement of εLN, the description graphs (syntax description graph and semantics description graph) are redefined. The satisfiability and subsumption reasoning algorithms of terminological cycles in description logic εLN w.r.t. fixpoint semantics are presented with simulation between description graphs. It is proved that the satisfiability and subsumption reasoning algorithms of terminological cycles in εLN are polynomial.

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

蒋运承,王驹,史忠植,汤庸.描述逻辑εLN 循环术语集的不动点语义及推理.软件学报,2009,20(3):477-490

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

京公网安备 11040202500063号