东北大学学报(自然科学版) ›› 2008, Vol. 29 ›› Issue (9): 1249-1252+1256.DOI: -

• 论著 • 上一篇    下一篇

模糊描述逻辑f-DLR-Lite∩的合取查询回答

程经纬;马宗民;严丽;王海龙;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2008-09-15 发布日期:2013-06-22
  • 通讯作者: Cheng, J.-W.
  • 作者简介:-
  • 基金资助:
    教育部高等学校博士学科点专项科研基金资助项目(20050145024);;

Conjunctive query answering to fuzzy description logic f-DLR-Lite

Cheng, Jing-Wei (1); Ma, Zong-Min (1); Yan, Li (1); Wang, Hai-Long (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2008-09-15 Published:2013-06-22
  • Contact: Cheng, J.-W.
  • About author:-
  • Supported by:
    -

摘要: 分析了描述逻辑合取查询回答的研究现状及存在的不足,在描述逻辑DL-Lite和模糊集理论的基础上,提出了一种可表示和处理n元关系,并允许在包含公理左侧出现概念合取的新的模糊描述逻辑f-DLR-Lite∩,并给出其语法和语义及知识库的形式.提出了一种兼容查询阈值和用户指定权重的模糊查询语言,给出了利用这种语言在f-DLR-Lite∩知识库上进行合取查询的具体步骤和算法,并进行了算法时间复杂度分析,讨论了该合取查询过程的一阶逻辑可归约性.f-DLR-Lite∩弥补了经典描述逻辑在知识表示和推理上的不足,扩展后的查询语言对用户查询意图的表达更加精确合理.

关键词: 描述逻辑, 合取查询, 模糊查询语言, 一阶逻辑可归约性, f-DLR-Lite∩

Abstract: The current research progress and shortages of the conjunctive query answering to description logic are analyzed. Based on the description logic DL-Lite and fuzzy set theory, a new fuzzy description logic f-DLR-Lite is presented to represent and process n-ary relation and allow the concept conjunction to occur in the left-hand of inclusion axioms, with its forms of syntax, semantics and knowledge base all given. A new fuzzy query language to which the query threshold is compatible with user-defined weight is presented, and its conjunctive query procedure and algorithm are given over the f-DLR-Lite knowledge base. Then, the complexity of the algorithm is analyzed with the FOL (first-order logic) reducibility of the procedure discussed. The f-DLR-Lite can make up for the insufficiency of knowledge representation and reasoning by classic DLs, and the extended query language can express users' intentions more precisely and reasonably.

中图分类号: