Abstract
We describe a technical solution for solving the following entailment problem in the Description Logic \(\cal{EL}\): \(({\cal T}\setminus U) \cup f^*({\cal T}\setminus U) \models C_1\sqsubseteq C_2\), where \({\cal T}\) is a TBox, C 1,C 2 are concepts, U is a subset of axioms of \({\cal T}\), and f * is a renaming function which gives a copy of TBox with some signature symbols injectively renamed. We introduce an enriched model structure for \(\cal{EL}\) TBoxes: once built for a given TBox \({\cal T}\), it allows for checking the entailment efficiently for different choices of C 1,C 2, U, and f *. This problem is concerned with computing explicit definitions of concepts wrt a signature and is an important part of the recently proposed algorithms for ontology decomposition.
This work was funded by the grant of the President of Russian Federation (Grant No. MK-2037.2011.9), the Russian Academy of Sciences (Grant No. 15/10), and the Siberian Division of the Russian Academy of Sciences (Integration Project No. 3).
This is a preview of subscription content, log in via an institution to check access.
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
Brandt, S.: Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and—What Else? In: Proc. Sixteenth European Conference on Artificial Intelligence, ECAI 2004 (2004)
Konev, B., Lutz, C., Ponomaryov, D., Wolter, F.: Decomposing description logic ontologies. In: Proc. Twelfth International Conference on the Principles of Knowledge Representation and Reasoning, KR 2010 (2010)
Konev, B., Lutz, C., Walther, D., Wolter, F.: Formal Properties of Modularisation. In: Parent, C., Spaccapietra, S., Stuckenschmidt, H. (eds.) Ontology Modularisation. Springer (2009)
Grimm, S., Wissmann, J.: Elimination of Redundancy in Ontologies. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part I. LNCS, vol. 6643, pp. 260–274. Springer, Heidelberg (2011)
Seylan, I., Franconi, E., de Bruijn, J.: Effective query rewriting with ontologies over dboxes. In: Proc. Twenty-first International Joint Conference on Artificial Intelligence, IJCAI 2009 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ponomaryov, D., Vlasov, D. (2012). On Definability and Redundancy in \(\cal{EL}\)–TBoxes. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-33203-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33202-9
Online ISBN: 978-3-642-33203-6
eBook Packages: Computer ScienceComputer Science (R0)