节点文献

支持模糊隶属度比较的扩展模糊描述逻辑

Extended Fuzzy Description Logics with Comparisons Between Fuzzy Membership Degrees

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 康达周徐宝文陆建江李言辉

【Author】 KANG Da-Zhou~1 XU Bao-Wen~(1,2+) LU Jian-Jiang~3 LI Yan-Hui~1 1(Department of Computer Science and Engineering,Southeast University,Nanjing 210096,China) 2(Jiangsu Institute of Software Quality,Nanjing 210096,China) 3(Institute of Command Automation,PLA University of Science and Technology,Nanjing 210007,China)

【机构】 东南大学计算机科学与工程学院江苏省软件质量研究所解放军理工大学指挥自动化学院

【摘要】 语义Web模糊知识的表示和应用常常涉及模糊隶属度比较,但现有描述逻辑的模糊扩展缺乏描述模糊隶属度比较的能力.提出支持模糊隶属度比较和描述逻辑ALCN(attributive concept description language with complements and number restriction)概念构造子的扩展模糊描述逻辑FCALCN(fuzzy comparable ALCN).FCALCN引入新的原子概念形式以支持模糊隶属度比较.给出FCALCN的推理算法,证明了在空TBox约束下FCALCN的推理问题复杂性是多项式空间完全的.FCALCN能够表达语义Web上涉及模糊隶属度比较的复杂模糊知识并实现对它们的推理.

【Abstract】 The representation and application of fuzzy knowledge on the semantic Web often relate to the comparisons between fuzzy membership degrees.However,the current fuzzy extensions of description logics do not support the expression of such comparisons.This paper proposes an extended fuzzy description logic that supports the comparisons of fuzzy membership degrees and the concept constructors from description logic ALCN (attributive concept description language with complements and number restriction),written FCALCN(fuzzy comparable ALCN).FCALCN introduces new forms of atom concepts in order to support the comparisons between fuzzy membership degrees.A reasoning algorithm for FCALCN is proposed,and the complexity of the reasoning problems of FCALCN with empty TBox is proved to be PSpace-complete.FCALCN can represent expressive fuzzy knowledge involving the comparisons of fuzzy membership degrees on the semantic Web and enable reasoning of them.

【基金】 国家自然科学基金;国家重点基础研究发展计划(973);高等学校博士学科点专项科研基金;江苏省自然科学基金;江苏省高技术研究项目~~
  • 【文献出处】 软件学报 ,Journal of Software , 编辑部邮箱 ,2008年10期
  • 【分类号】TP301
  • 【被引频次】21
  • 【下载频次】402
节点文献中: 

本文链接的文献网络图示:

本文的引文网络