Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (2): 48-52.

Previous Articles     Next Articles

Matching in description logic [ELN]

ZHANG Wei1, YU Quan1, WANG Ju2, JIANG Yuncheng3,4   

  1. 1.Department of Math, Qiannan Normal College for Nationalities, Duyun, Guizhou 558000, China
    2.College of Computer Science and Information Engineering, Guangxi Normal University, Guilin, Guangxi 541004, China
    3.School of Computer Science, South China Normal University, Guangzhou 510631, China
    4.State Key Lab of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
  • Online:2013-01-15 Published:2013-01-16

描述逻辑系统[ELN]中概念的匹配算法研究

张  维1,余  泉1,王  驹2,蒋运承3,4   

  1. 1.黔南民族师范学院 数学系,贵州 都匀 558000
    2.广西师范大学 计算机科学与信息工程学院,广西 桂林 541004
    3.华南师范大学 计算机学院,广州 510631
    4.中国科学院 计算机科学国家重点实验室,北京 100190

Abstract: The importance of the nonstandard inference in description logic is analyzed and the current research work and existing problems are summed up. Aiming to the insufficiency of the matching inference which can’t handle number restriction and existential restriction at the same time, this work concentrates on matching inference in description logic [ELN]. The concept patterns are defined by introducing in concept variables in description logic language, then the matching algorithm of [ELN]is presented, its soundness is proved and it is pointed out that the cardinality of the minimal completed set of matchers is exponential of the size of the matching problem.

Key words: description logic, concept pattern, matching

摘要: 分析了描述逻辑非标准推理的重要性,总结了描述逻辑中概念的匹配推理研究现状和存在的问题,针对匹配推理在处理数量限制和存在量词的不足研究了描述逻辑系统[ELN]中概念的匹配推理。将概念变量引入描述语言[ELN],定义出了[ELN]中概念模式,进而给出了[ELN]中概念的匹配算法,证明了算法的可靠性并指出该算法计算出的匹配极小完全集的基数是随着匹配问题的大小(size)呈指数增长的。

关键词: 描述逻辑, 概念模式, 匹配