Second-order linear reasoning mechanisms for description logic εL

被引：0
|
作者：
Wang J. [1 ]
Chen G.-X. [1 ]
Yu Q. [2 ]
机构：
[1] Guangxi Key Laboratory of Trusted Software (Guilin University of Electronic Technology), Guilin
[2] Department of Mathematics, Normal College of Minorities of South Guizhou, Duyun
来源：
Chen, Guang-Xi (chgx@guet.edu.cn) | 2017年 / Chinese Academy of Sciences卷 / 28期
基金：
中国国家自然科学基金;
关键词：
Conservative extension; Description logic; Dl-lite family; Ontology module extracting; Second-order linear reasoning mechanism;
D O I：
10.13328/j.cnki.jos.004950
中图分类号：
学科分类号：
摘要：
In the framework of description logics, the theories and their related algorithms of conservative extensions, modularity and module extraction are the core notions and vital tools in engineering semantic Web construction, ontology construction, ontology merging and reuse. Among other important contributions in this area, Lutz, et al. have shown that the conservative extension problem for ALC is decidable but its complexity is 2ExpTime-complete while the complexity of the deciding algorithm for light-weight εL is 1ExpTime- complete. Their deciding algorithms are basically depends on tableau algorithm which is substantially a reasoning mechanism in first-order predicate logic. Although, theoretically speaking, those results and algorithms are significant and valuable, both existing theories and methods appear to be complicated, difficult to understand, and hard to implement by engineers working on the semantic Web and ontology construction. This paper will not discuss and analyze the current theories and their algorithms. Instead, it independently proposes a second-order linear reasoning mechanism for all members of DL-Lite family. A proof of the completeness of the second-order deduction system is provided. The proposed mechanism is intuitive, easy to manipulate, and much easier to implement in the engineering sector. It is uniformly applicable for members of DL-Lite family such as εL, FL0, FLε, and vL. Most of all, this system is consistent with graph deduction that facilitates design and construction of the necessary graphs by using space to exchange with time cost. As a result, the time complexity is reduced significantly such that if the space and deduction graphs are sophisticatedly equipped, the deciding time can be reduced topolynomial. © Copyright 2017, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：216 / 233
页数：17
相关论文
共 14 条
  • [1] Ghilardi S., Lutz C., Wolter F., Did I damage my ontology? A case for conservative extensions in description logics, Proc. of the KR 2006, pp. 187-197, (2006)
  • [2] Lutz C., Walther D., Wolter F., Conservative extensions in expressive description logics, Proc. of the IJCAI 2007, pp. 453-458, (2007)
  • [3] Lutz C., Toman D., Wolter F., Conjunctive query answering in the description logic εL using a relational database system, Proc. of the 21st Int'l Joint Conf. on Artificial Intelligence (IJCAI 2009), pp. 2070-2075, (2009)
  • [4] Li P., Modular construction and reuse of domain ontology, (2010)
  • [5] Shen Y.M., Wang J., Complexity of conservative extensions and inseparability in the description logic εL, The Semantic Web and Web Science, pp. 78-86, (2014)
  • [6] Nie D.G., Kang W.Q., Cao F.S., Wang J., Containing reasoning and its conservative extensions in description logic εL<sub>0</sub>, Journal of Computer Research and Development, 52, 1, pp. 221-228, (2015)
  • [7] Baader F., Calvvanese D., Mcguinness D.L., Nardi D., Patel-Schneider P.F., The Description Logic Handbook: Theory, Implementation and Applications, (2003)
  • [8] Lutz C., Wolter F., Conservative extensions in the lightweight description logic εL, Proc. of the CADE 2007., pp. 84-99, (2007)
  • [9] Cuenca Grau B., Horrocks I., Kazakov Y., Sattler U., A logical framework for modularity of ontologies, Proc. of the Int'l Joint Conf. on Artificial Intelligence (IJCAI), pp. 298-304, (2007)
  • [10] Lutz C., Seylan I., Wolter F., An automata-theoretic approach to uniform interpolation and approximation in the description logic εL, Journal of Internet Services & Applications, 2, 2, pp. 171-185, (2012)
12