Abstract
This work is a continuation of our previous works [4,5]. We assume that the reader is familiar with description logics (DLs). A knowledge base in a description logic is a tuple \(({\mathcal{R}},{\mathcal{T}},{\mathcal{A}})\) consisting of an RBox \({\mathcal{R}}\) of assertions about roles, a TBox \({\mathcal{T}}\) of global assumptions about concepts, and an ABox \({\mathcal{A}}\) of facts about individuals (objects) and roles. The instance checking problem in a DL is to check whether a given individual a is an instance of a concept C w.r.t. a knowledge base \(({\mathcal{R}},{\mathcal{T}},{\mathcal{A}})\), written as \(({\mathcal{R}},{\mathcal{T}},{\mathcal{A}}) \models C(a)\). This problem in DLs including the basic description logic \(\mathcal{ALC}\) (with \({\mathcal{R}} = \emptyset\)) is EXPTIME-hard.From the point of view of deductive databases, \({\mathcal{A}}\) is assumed to be much larger than \({\mathcal{R}}\) and \({\mathcal{T}}\), and it makes sense to consider the data complexity, which is measured when the query consisting of \({\mathcal{R}}\), \({\mathcal{T}}\), C, a is fixed while \({\mathcal{A}}\) varies as input data.It is desirable to find and study fragments of DLs with PTIME data complexity. Several authors have recently introduced a number of Horn fragments of DLs with PTIME data complexity [2,1,3]. The most expressive fragment from those is Horn-\(\mathcal{SHIQ}\) introduced by Hustadt et al. [3]. It assumes, however, that the constructor ∀ R.C does not occur in bodies of program clauses and goals.The data complexity of the “general Horn fragment of \(\mathcal{ALC}\)” is coNP-hard [6]. So, to obtain PTIME data complexity one has to adopt some restrictions for the “general Horn fragments of DLs”. The goal is to find as less restrictive conditions as possible.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR 2006, pp. 260–270. AAAI Press, Stanford (2006)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of WWW 2003, pp. 48–57 (2003)
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proceedings of IJCAI 2005, pp. 466–471. Professional Book Center (2005)
Nguyen, L.A: A bottom-up method for the deterministic Horn fragment of the description logic \(\mathcal{ALC}\). In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 346–358. Springer, Heidelberg (2006)
Nguyen, L.A.: On the deterministic Horn fragment of test-free PDL. In: Advances in Modal Logic, vol. 6, pp. 373-392. King’s College Publications (2006)
Nguyen, L.A.: The full version of this paper, http://www.mimuw.edu.pl/~nguyen/RG.pdf
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, L.A. (2007). Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity. In: Dahl, V., Niemelä, I. (eds) Logic Programming. ICLP 2007. Lecture Notes in Computer Science, vol 4670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74610-2_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-74610-2_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74608-9
Online ISBN: 978-3-540-74610-2
eBook Packages: Computer ScienceComputer Science (R0)