期刊文献+

循环描述逻辑TBOX中的完备格

Complete Lattice in Cyclic Description Logic TBOX
下载PDF
导出
摘要 描述逻辑中含有循环定义的TBox通常使用固定点模型来刻画循环定义的语义,对于固定点模型,不仅需要研究其存在性,还需要研究模型之间的关系,如是否存在最大、最小固定点模型。TBox中所有模型扩展集合上的偏序关系可以诱导出格结构,而且是完备格,现有的研究得出的一些结论主要是针对此完备格。考虑在特定固定点下,概念解释域上的偏序关系同样可以诱导出格。对这种格进行研究得出了一些有益的结论,这些结论为深入研究循环描述逻辑语义提供了新的思路。 Description Logic TBOX with cyclic definitions is generally used fixpoint model to character its semantics ,we need study the existence of fixpoint model and also relations between models such as GFP or LFP model is existed .All partial order relations on existents set of models in TBOX can induce Lattice structure which is complete .Some conclusions have been drawn from this complete lattice so far .It is considered partial order relations on interpretation domain of concept can also induce lattice structure .we study this lattice and draw some conclusions ,which provide a new way of thinking for studying the semantics of cyclic description logic deeply .
作者 张勇 陈丽萍
出处 《皖西学院学报》 2014年第5期35-37,共3页 Journal of West Anhui University
基金 巢湖学院自然科学研究资助项目(XLY-201408) 巢湖学院本科教学质量与教学改革工程资助项目(ch13yykc06) 巢湖学院教学研究项目(Jyxm201104)
关键词 循环描述逻辑 TBox 完备格 模型 cyclic description logic TBOX complete lattice model
  • 相关文献

参考文献17

  • 1Badder F, Calvanese D, McGuinnes D, et al. The Descip tion Logic Handbook: Theory, Implemntation and Appli cations [M]. London, UK: Cambridge UniversityPresss,2003.
  • 2De Giacomo G, Lenzerini M. TBox, ABox Reasoning in Expressive Description Logics[C]. In: Proceedings of the Fifth International Conference on the Principles of Knowl edge Representation and Reasoning. Cambridge, Massa- chusetts, USA, 1996: 316-327.
  • 3Badder F, Horrocks I, Sattler U. Description Logics as Ontology Languanges for the Semantic Web[J].In: Hutter D, StephanW, eds. Festschrift in Hononor of Jorg Sick- mann, Lecture Notes in Artificial Intelligence. Springer, 2005,2605 : 228-248.
  • 4Borgida A, Lenzerini M, Rosati R. Description Logics for Data Bases[C]. In: Badder F, McGuinness D, Nardi d, et al. eds. Chapter 16. Cambridge University Press, 2003.
  • 5Pascal Fontaine, Christophe Ringeissen, Renate A. Schmidt. Hybrid Unification in the Description Logic (mathcal { EL } ) [J]. Frontiers of Combining Systems. Lecture Notes in Computer Science, 2013,8152: 295 -310.
  • 6Giacomo G D, Lenzerini M. A Uniform Framework for Concept Definitions in Description Logics[J]. Journal of Artificial Intelligence Research, 1997, 6 (1) : 87-110.
  • 7Buchheit M, Donini FM, Nutt W, Schaerf A. A Refined Architeture for Terminological Systems: Terminology : Schema + Views [J]. Artificial Intelligence, 1998, 9 ( 2 ) : 209-260.
  • 8Badder F, Using Automata Theory for Characterizing the Semanticsof Terminological Cycles[J]. Annals of Mathe- matics and Artificial Intelligence, 1996,18(2-4) : 175-219.
  • 9Nebel B. Terminological Cycles= Semantics and Computa- tionalProperties[C]. Sowa J F. Principles of SemanticNetworks. San Francisco: Morgan Kaufmann Publishers, 1991:331-362.
  • 10Badder F. Terminological Cycles in a Description Logic with Existential Restrictions[C]. Gottlob G, Walsh T. Proc of the 18th Int'l Joint conf on Artificial Intelligence (UCAI 2003). San Francisco: Morgan Kaufmann Pub- lishers, 2003: 325-330.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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