Abstract
In this paper we investigate module extraction for the Description Logic \(\mathcal{SRIQ}\). We formulate modules in terms of the reachability problem for directed hypergraphs. Using inseparability relations, we investigate the module-theoretic properties of reachability modules and show by means of an empirical evaluation that these modules have the potential of being substantially smaller than syntactic locality modules.
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
Antoniou, G., Kehagias, A.: A note on the refinement of ontologies. International Journal of Intelligent Systems 15, 623–632 (2000)
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The description logic handbook: theory, implementation, and applications. Cambridge University Press, New York (2003)
Cuenca Grau, B., Halaschek-Wiener, C., Kazakov, Y., Suntisrivaraporn, B.: Incremental Classification of Description Logic Ontologies. Tech. rep. (2012)
Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: Just the right amount: extracting modules from ontologies. In: Williamson, C., Zurko, M. (eds.) Proceedings of the 16th International Conference on World Wide Web (WWW 2007), pp. 717–726. ACM, New York (2007)
Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: Modular Reuse of Ontologies: Theory and Practice. Journal of Artificial Intelligence Research (JAIR) 31, 273–318 (2008)
Del Vescovo, C., Parsia, B., Sattler, U., Schneider, T.: The modular structure of an ontology: atomic decomposition and module count. In: Kutz, O., Schneider, T. (eds.) Proc. of WoMO 2011. Frontiers in AI and Appl., vol. 230, pp. 25–39. IOS Press (2011)
Ghilardi, S., Lutz, C., Wolter, F.: Did I damage my ontology? A case for conservative extensions in description logics. In: Doherty, P., Mylopoulos, J., Welty, C. (eds.) Proceedings of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 187–197. AAAI Press (2006)
Horridge, M., Parsia, B., Sattler, U.: Laconic and precise justifications in OWL. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 323–338. Springer, Heidelberg (2008)
Horrocks, I., Kutz, O., Sattler, U.: The irresistible \(\mathcal{SRIQ}\). In: Proc. of OWL: Experiences and Directions (2005)
Konev, B., Lutz, C., Walther, D., Wolter, F.: Formal properties of modularisation. In: Stuckenschmidt, H., Parent, C., Spaccapietra, S. (eds.) Modular Ontologies. LNCS, vol. 5445, pp. 25–66. Springer, Heidelberg (2009)
Kontchakov, R., Pulina, L., Sattler, U., Schneider, T., Selmer, P., Wolter, F.: Minimal module extraction from DL-Lite ontologies using qbf solvers. In: Boutilier, C. (ed.) IJCAI, pp. 836–841 (2009)
Kontchakov, R., Wolter, F., Zakharyaschev, M.: Logic-based ontology comparison and module extraction, with an application to dl-lite. Artificial Intellighence 174(15), 1093–1141 (2010)
Nguyen, S., Pretolani, D., Markenzon, L.: On some path problems on oriented hypergraphs. Theoretical Informatics and Applications 32(1-2-3), 1–20 (1998)
Nortjé, R.: Module extraction for inexpressive description logics. Master’s thesis, University of South Africa (2011)
Nortjé, R., Britz, K., Meyer, T.: Bidirectional reachability-based modules. In: Proceedings of the 2011 International Workshop on Description Logics (DL 2011). CEUR Workshop Proceedings, CEUR-WS (2011), http://ceur-ws.org
Nortjé, R., Britz, K., Meyer, T.: A normal form for hypergraph-based module extraction for \(\mathcal{SROIQ}\). In: Gerber, A., Taylor, K., Meyer, T., Orgun, M. (eds.) Australasian Ontology Workshop 2009 (AOW 2012). Ceur-ws, vol. 969, pp. 40–51. CEUR, Melbourne (2012), http://ceur-ws.org/Vol-969/proceedings.pdf
Nortjé, R., Britz, K., Meyer, T.: Module-theoretic properties of reachability modules for \(\mathcal{SRIQ}\). In: Description Logic Workshop 2013 (DL 2013). CEUR-WS, CEUR, Ulm, Germany (2013)
Sattler, U., Schneider, T., Zakharyaschev, M.: Which kind of module should I extract? In: Grau, B.C., Horrocks, I., Motik, B., Sattler, U. (eds.) Description Logics. CEUR Workshop Proceedings, vol. 477, CEUR-WS.org (2009)
Suntisrivaraporn, B.: Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies. Ph.D. thesis, Technical University of Dresden (2009)
Thakur, M., Tripathi, R.: Complexity of Linear Connectivity Problems in Directed Hypergraphs. In: Linear Connectivity Conference, pp. 1–12 (2001)
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
Nortje, R., Britz, K., Meyer, T. (2013). Reachability Modules for the Description Logic \(\mathcal{SRIQ}\) . In: McMillan, K., Middeldorp, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2013. Lecture Notes in Computer Science, vol 8312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45221-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-45221-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45220-8
Online ISBN: 978-3-642-45221-5
eBook Packages: Computer ScienceComputer Science (R0)