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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of IJCAI 2005, pp. 364–369. Morgan-Kaufmann Publishers (2005)
Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope further. In: Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)
Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of ECAI 2004, pp. 298–302. IOS Press (2004)
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)
Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reasoning 51(3), 346–362 (2010)
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.: Reasoning in description logics by a reduction to disjunctive Datalog. J. Autom. Reasoning 39(3), 351–384 (2007)
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.: Constructing finite least Kripke models for positive logic programs in serial regular grammar logics. Logic Journal of the IGPL 16(2), 175–193 (2008)
Nguyen, L.A.: Horn knowledge bases in regular description logics with PTime data complexity. Fundamenta Informaticae 104(4), 349–384 (2010)
Nguyen, L.A., Nguyen, T.-B.-L., Szałas, A.: A long version of the current paper (since April 2013), http://www.mimuw.edu.pl/~nguyen/horn_dl_long.pdf
Nguyen, L.A., Szałas, A.: On the Horn fragments of serial regular grammar logics with converse. Accepted for KES-AMSTA 2013 (2013)
Ortiz, M., Rudolph, S., Simkus, M.: Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In: Walsh, T. (ed.) Proceedings of IJCAI 2011, pp. 1039–1044 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-39666-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-39666-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39665-6
Online ISBN: 978-3-642-39666-3
eBook Packages: Computer ScienceComputer Science (R0)