期刊文献+

带RVM的描述逻辑εL混合循环术语集的语义及推理 被引量:1

Semantics and Reasoning of Hybrid Terminological Cycles in Description Logic εL with RVM
原文传递
导出
摘要 分析描述逻辑循环术语集的研究现状和存在的问题,在F.Baader和S.Brandt的基础上进一步研究带RVM的描述逻辑εL混合循环术语集的语义及推理问题.给出带RVM的εL混合循环术语集的语法和语义.针对带RVM的εL混合循环术语集包含推理的需要,提出TBox-完全的概念,并重新定义描述图,使用描述图之间的模拟关系和TBox-完全给出最大不动点语义和描述语义下带RVM的εL混合循环术语集的概念包含推理算法,证明推理算法的正确性,并证明推理算法是多项式时间复杂的. The current research progresses and problems of terminological cycles in description logics are analyzed in this paper. Based on the research of Baader F and Brandt S, the semantics and reasoning of hybrid terminological cycles in description logic eL with RVM is further studied. The syntax and semantics of hybrid terminological cycles in description logic eL with RVM are given. Aiming at the requirement of subsumption reasoning of hybrid terminological cycles in description logic eL with RVM, TBox-completion is presented and the description graph is redefined. The subsumption reasoning algorithms of hybrid terminological cycles in description logic eL with RVM w. r. t. greatest fixpoint semantics and descriptive semantics are presented using TBox-completion and description graph.The correctness of reasoning algorithms has been proved. And it is also proved that the subsumption reasoning w. r. t. greatest fixpoint semantics and descriptive semantics can be computed in polynomial time.
出处 《模式识别与人工智能》 EI CSCD 北大核心 2008年第1期18-27,共10页 Pattern Recognition and Artificial Intelligence
基金 国家自然科学基金项目(No.60663001,60673135,60373081,60573010) 中国博士后科学基金项目(No.20060400226) 广西青年科学基金项目(No.桂科青0640030)资助
关键词 描述逻辑 混合循环术语集 不动点语义 描述语义 关系-值-映射(RVM) Description Logic, Hybrid Terminological Cycles, Fixpoint Semantics, Descriptive Semantics, Role-Value-Maps (RVM)
  • 相关文献

参考文献13

  • 1Giacomo G, I.enzerini M. A Uniform Framework for Concept Definitions in Description Logics. Journal of Artificial Intelli gence Research, 1997, 6(1):87-110.
  • 2Buchheit M, Donini F M, Nutt W, et al. A Refined Architecture for Terminological Systems:Terminology = Schema + Views. Artificial Intelligence, 1998, 99(2) : 209-260.
  • 3Baader F. Using Automata Theory for Characterizing the Semantics of Terminological Cycles. Annals of Mathematics and Artificial Intelligence, 1996, 18(2/3/4): 175-219.
  • 4Nebel B. Terminological Cycles:Semantics and Computational Properties Sowa J F, ed. Principles of Semantic Networks. San Mateo, USA:Morgan Kaufmann Publishers, 1991:331- 361.
  • 5Nebel B. Reasoning and Revision in Hybrid Representation Systems. Berlin, Germany: Springer-Verlag, 1990.
  • 6Baader F. Terminological Cycles in a Description Logic with Existential Restrictions Proc of the 18th International Joint Conference on Artificial Intelligence. Acapulco, Mexico, 2003: 325-330.
  • 7Schmidt SchaubβM. Subsumption in KL-ONE is Undecidable Proc of the 1st Internalional Conference on Principles of Knowledge Represenlation and Reasoning. San Francisco, USA. 1989:301-311.
  • 8Horrocks I, Sattler U. Decidability of SHIQ with Complex Role Inclusion Axioms. Artificial Intelligence, 2004, 160(1/2) : 79- 104.
  • 9Baader F. Restricted Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles Proc of the International Workshop on Description Logics. Aachen, Germany, 2003,113-122.
  • 10Brandt S, Model J. Subsumption in d. w. r.t. Hybrid TBoxes Proc of the 28th Annual German Conference on Artificial In telligence. Koblenz, Germany, 2005:34-48.

同被引文献11

  • 1Baader F.Using automata theory for characterizing the semantics of temunological cycles[J].Annals of Mathematics and Artificial Intel-ligence,1996,18(2/4):175-219.
  • 2Nebel B.Terminolopcal cycles:Semantics and computational proper-ties[C]//Sowa J F.Principles of Semantic Networks.San Francisco:Morgan Kaufmann Publishers,1991:331-362.
  • 3Baader F.Terminolopcal cycles in a description lopc with existen-tial restrictions[C]//Gottlob G,Walsh T.Proc of the 18th Int'1 Joint Conf on Artificial Intelligence(UCAI 2003).San Francisco:Morgan Kaufmann Publishers,2003:325-330.
  • 4Baader F.Least common subsumers and most specific concepts in a description logic with existential restrictions and temunological cycles[C]//Gottlob G,Walsh T.Proc of the 18th Int'1 Joint Conf on Artificial Intelligece(UCAI 2003)San Francisco:Morgan Kaufmann Publishers,2003:319-324.
  • 5Tarski A.A lattice-theoretical fixpoint theorem and its applica-tions[J].Pacific Journal of Mathematics,1955,5(2):285-309.
  • 6Baader F.Computing least common subsumers in description logics with existential restrictions[C]//Dean T.Proc of 16th Int'1 Joint Conf on Artificial Intelligence(IJCAI 1999)San Francisco:Morgan Kauf-mann Publishers,1999:96-101.
  • 7Baader F.A finite basis for the set of EL-implications holding in a finite model[C]//Medina R,Obiedkov S.Proc of the 6th Interna-tional Conference on Formal Concept Analysis(ICFCA 2008).Berlin:Springer,2008.4933:46-61.
  • 8Henzinger M R.Computing simulations on finite and infirute grapha[C]//Milwaukee,Wisconsin.36th Annual Symposium on Foundations of Computer Science(FOCS 1995).[S.1.]:IEEE Computer Society Press,1995:453-462.
  • 9曹发生,余泉,王驹,蒋运承.循环ALCN-Tbox具有模型的条件[J].计算机学报,2008,31(1):16-23. 被引量:13
  • 10蒋运承,王驹,邓培民,汤庸.描述逻辑FL-循环术语集的语义及推理[J].计算机学报,2008,31(2):185-195. 被引量:9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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