期刊文献+

一种带传递关系的认知描述逻辑研究 被引量:4

Study of an Epistemic Description Logic with Transitive Roles
下载PDF
导出
摘要 描述逻辑是语义Web的逻辑基础,它是形式化表达领域知识的一种工具.描述逻辑是一阶逻辑的可判定子集,适合对领域知识的概念术语进行建模.因为某些应用程序的需要和领域知识难以完全描述的因素,Web上有大量的不完全知识.描述逻辑基于开放世界假设,只能表达单调推理,不能处理不完全知识.在描述逻辑中加入认知运算符K可以得到认知描述逻辑.认知描述逻辑因其非单调特性和良好的时间复杂度等特点在处理不完全知识方面有较好的优势.在认知描述逻辑ALCK的基础上加入传递关系属性提出了新的认知描述逻辑语言ALCKR+,保留了描述逻辑原有的优点,增强了表达能力并通过认知查询拥有了非单调推理的能力.设计了ALCKR+的语法、语义以及表算法,给出了表算法的正确性以及可判定性证明,证明表算法的时间复杂度为PSPACE-complete. Description logic is the logical foundation of the semantic Web. It is a tool for formally expressing domain knowledge. Description logic is the decidable fragment of the first order logic and suitable for modeling the concept terminology of domain knowledge. Because some application requirements and people can not describe all of the domain knowledge, there is lots of incomplete knowledge on the Web. Description logic is based on the open world assumption. It can only express the monotonic reasoning and can not solve the incomplete knowledge. By adding the epistemic operator "K" to the description logic, the epistemic description logic can be obtained. It has the advantage of dealing with the incomplete knowledge because of the non-monotonic features and the good computational complexity. The authors present a new epistemic description logic ALCKR~ based on the epistemic description logic ALCK, preserve the primary advantage of the description logic, add transitive roles for improving the expressivity, express the non-monotonic reasoning ability through the epistemic query, and design the syntax and semantic of ALCKR+. The corresponding tableau algorithm is also provided. The soundness and decidability of the tableau algorithm are proved. It is shown that the complexity of tableau algorithm is PSPACE-complete.
出处 《计算机研究与发展》 EI CSCD 北大核心 2009年第3期452-458,共7页 Journal of Computer Research and Development
基金 国家自然科学基金重点项目(60433020) 湖南省自然科学基金项目(06JJ50142)~~
关键词 描述逻辑 认知描述逻辑 传递关系 认知查询 表算法 description logic epistemic description logic transitive roles epistemic query tableau algorithm
  • 相关文献

参考文献13

  • 1Berners-Lee T, Hendler J, Lassila O. The semantic Web [J]. Scientific American, 2001, 184(5): 34-43
  • 2Baader F, Calvanese D, McGuinnes D, et al. The Description Logic Handbook: Theory, Implementation, and Application [M]. London, UK: Cambridge Univerity Press, 2003
  • 3Donini Francesco M, Lenzerini M, Nardi D, et al. An epistemic operator for description logics [J]. Artificial Intelligence, 1998, 100(1-2): 225-274
  • 4Sehmidt Schaub M, Smolka G. Attributive concept descriptions with complements [J]. Artificial Intelligence, 1991, 48(1): 1-26
  • 5Calvanese Diego, De Giacomo G, Lembo D, et al. Epistemic first-order queries over description logic knowledge bases [C] //Proc of the 2006 Int Workshop on Description Logic. Aachen, Germany: CEUR Press, 2006: 51-61
  • 6王淞昕,王飞,周水庚,周傲英.N-SHOQ(D):描述逻辑SHOQ(D)的一个非单调扩展[J].计算机研究与发展,2005,42(4):570-575. 被引量:7
  • 7董明楷,蒋运承,史忠植.一种带缺省推理的描述逻辑[J].计算机学报,2003,26(6):729-736. 被引量:52
  • 8Sattler U. A concept language extended with different kinds of transitive roles [C] //Proc of the 20th Annual German Conf on Artificial Intelligence. Berlin: Springer, 1996: 333- 345
  • 9Donini Francesco M, Lenzerini M, Nardi D, et al. Deduction in concept languages: From subsumption to instance checking [J]. Journal of Logic and Computation, 1994, 4(4): 423- 452
  • 10Baader F, Sturm H, Wolter F. Fusions of description logics and abstract description systems [J]. Journal of Artificial Intelligence Research, 2002, 16(1) : 1-58

二级参考文献24

  • 1Baader F, et al. The Description Logic Handbook: Theory,Implementation and Applications. Cambridge: Cambridge University Press, 2002.
  • 2Brachman R J, Schmolze J G. An overview of the KL-ONE knowledge representation system. Cognitive Science, 1985, 9(2): 171-216.
  • 3Schmidt-Schauβ M, Smolka G. Attributive concept descriptions with complements. Artificial Intelligence, 1991, 48(1) : 1-26.
  • 4Reiter R. A logic for default reasoning. Artificial Intelligence,1980, 13(1): 81-132.
  • 5McCarthy J. Circumscription-A form of non-monotonic reasoning. Artificial Intelligence, 1980, 13(1): 27-39.
  • 6Brewka G. Nonmonotonic Reasoning- Logical Foundations of Commonsense. Cambridge: Cambridge University Press, 1991.
  • 7Baader F, Hullunder B. Embedding defaults into terminological representation systems. Journal of Automated Reasoning,1995, 14(1): 149-180.
  • 8Baader F, Hollunder B. Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. Journal of Automated Reasoning, 1995, 15(1): 41-68.
  • 9Haarslev V, Moeller R, Turhan A Y, Wessel M. On terminological default reasoning about spatial information: Extended abstract. In: Proceedings of the International Workshop on Description Logics (DL' 99), Linkoping, Sweden, 1999. 155-159.
  • 10Lambrix P, Shahmehri N, Wahlloef N. A default extension to description logics for use in an intelligent search engine. In:Proceedings of the 31st Hawaii International Conference on System Sciences, Volume V - Modeling Technologies and Intelligent Systems Track, Hawaii, 1998. 28-35.

共引文献56

同被引文献61

引证文献4

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部