HornDL: An Expressive Horn Description Logic with PTime Data Complexity

  • Linh Anh Nguyen
  • Thi-Bich-Loc Nguyen
  • Andrzej Szałas
Conference paper

DOI: 10.1007/978-3-642-39666-3_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7994)
Cite this paper as:
Nguyen L.A., Nguyen TBL., Szałas A. (2013) HornDL: An Expressive Horn Description Logic with PTime Data Complexity. In: Faber W., Lembo D. (eds) Web Reasoning and Rule Systems. RR 2013. Lecture Notes in Computer Science, vol 7994. Springer, Berlin, Heidelberg

Abstract

We introduce a Horn description logic called Horn-DL, which is strictly and essentially richer than Horn-\(\mathcal{SROIQ}\), while still has PTime data complexity. In comparison with Horn-\(\mathcal{SROIQ}\), HornDL additionally allows the universal role and assertions of the form irreflexive(s), \(\lnot s(a,b)\), \(a \not\doteq b\). More importantly, in contrast to all the well-known Horn fragments \(\mathcal{EL}\), DL-Lite, DLP, Horn-\(\mathcal{SHIQ}\), Horn-\(\mathcal{SROIQ}\) of description logics, HornDL allows a form of the concept constructor “universal restriction” to appear at the left hand side of terminological inclusion axioms. Namely, a universal restriction can be used in such places in conjunction with the corresponding existential restriction. In the long version of this paper, we present the first algorithm with PTime data complexity for checking satisfiability of HornDL knowledge bases.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Linh Anh Nguyen
    • 1
    • 2
  • Thi-Bich-Loc Nguyen
    • 3
  • Andrzej Szałas
    • 1
    • 4
  1. 1.Institute of InformaticsUniversity of WarsawWarsawPoland
  2. 2.Faculty of Information TechnologyVNU University of Engineering and TechnologyHanoiVietnam
  3. 3.Department of Information TechnologyHue University of SciencesHue cityVietnam
  4. 4.Dept. of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations