Abstract
One of the core services provided by OWL reasoners is classification: the discovery of all subclass relationships between class names occurring in an ontology. Discovering these relations can be computationally expensive, particularly if individual subsumption tests are costly or if the number of class names is large. We present a classification algorithm which exploits partial information about subclass relationships to reduce both the number of individual tests and the cost of working with large ontologies. We also describe techniques for extracting such partial information from existing reasoners. Empirical results from a prototypical implementation demonstrate substantial performance improvements compared to existing algorithms and implementations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baader, F., et al.: An empirical analysis of optimization techniques for terminological representation systems or: Making KRIS get a move on. Applied Artificial Intelligence. Special Issue on Knowledge Base Management 4, 270–281 (1994)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 364–369 (2005)
Daskalakis, C., Karp, R.M., Mossel, E., Riesenfeld, S., Verbin, E.: Sorting and selection in posets. CoRR, abs/0707.1532 (2007)
Ellis, G.: Compiled hierarchical retrieval. In: 6th Annual Conceptual Graphs Workshop, pp. 285–310 (1991)
Faigle, U., Turán, G.: Sorting and recognition problems for ordered sets. In: Mehlhorn, K. (ed.) STACS 1985. LNCS, vol. 182, pp. 109–118. Springer, Heidelberg (1984)
Haarslev, V., Möller, R.: High performance reasoning with very large knowledge bases: A practical case study. In: Nebel, B. (ed.) Proceedings of Seventeenth International JointŁConference on Artificial Intelligence, IJCAI 2001, pp. 161–166 (2001)
Haarslev, V., Möller, R., Turhan, A.-Y.: Exploiting pseudo models for tBox and aBox reasoning in expressive description logics. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 61–75. Springer, Heidelberg (2001)
Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester (1997)
Motik, B., Shearer, R., Horrocks, I.: Optimized Reasoning in Description Logics Using Hypertableaux. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 67–83. Springer, Heidelberg (2007)
Tsarkov, D., Horrocks, I., Patel-Schneider, P.F.: Optimising terminological reasoning for expressive description logics. J. of Automated Reasoning (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shearer, R., Horrocks, I. (2009). Exploiting Partial Information in Taxonomy Construction. In: Bernstein, A., et al. The Semantic Web - ISWC 2009. ISWC 2009. Lecture Notes in Computer Science, vol 5823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04930-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-04930-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04929-3
Online ISBN: 978-3-642-04930-9
eBook Packages: Computer ScienceComputer Science (R0)