Abstract
Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in a Semantic Web context. For OWL ontologies, i.e., Description Logic (DL) Knowledge Bases, it is known that reasoning is a hard problem. Especially in instance retrieval when the number of instances that need to be retrieved becomes very large. We discuss two approximation methods for retrieving instances to conjunctive queries over DL T-Boxes and the results of experiments carried out with a modified version of the Instance Store System.
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.
Similar content being viewed by others
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook - Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
Groot, P., Stuckenschmidt, H., Wache, H.: Approximating Description Logic Classification for Semantic Web Reasoning. In: Gómez-Pérez, A., Euzenat, J. (eds.) ESWC 2005, vol. 3532, pp. 318–332. Springer, Heidelberg (2005)
Haarslev, V., Möller, R.: RACE system description. In: Proceedings of the 1999 DL Workshop, CEUR Electronic Workshop Proceedings, pp. 130–132 (1999)
Haarslev, V., Möller, R.: High performance reasoning with very large knowledge bases: A practical case study. In: IJCAI 2001, pp. 161–168 (2001)
Haarslev, V., Möller, R.: RACER system description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 701–705. Springer, Heidelberg (2001)
Horrocks, I.: The FACT system. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS, vol. 1397, pp. 307–312. Springer, Heidelberg (1998)
Horrocks, I.: Using an Expressive Description Logic: FaCT or Fiction? In: KR 1998, pp. 636–647. Morgan Kaufmann, San Francisco (1998)
Horrocks, I., Li, L., Turi, D., Bechhofer, S.: The Instance Store: DL Reasoning with Large Numbers of Individuals. In: Proc. of the 2004 DL Workshop (2004)
Horrocks, I., Tessaris, S.: A Conjunctive Query Language for Description Logic Aboxes. In: AAAI, pp. 399–404 (2000)
Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74, 249–310 (1995)
Stuckenschmidt, H., van Harmelen, F.: Approximating terminological queries. In: Andreasen, T., Motro, A., Christiansen, H., Larsen, H.L. (eds.) FQAS 2002. LNCS, vol. 2522, pp. 329–343. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wache, H., Groot, P., Stuckenschmidt, H. (2005). Scalable Instance Retrieval for the Semantic Web by Approximation. In: Dean, M., et al. Web Information Systems Engineering – WISE 2005 Workshops. WISE 2005. Lecture Notes in Computer Science, vol 3807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11581116_26
Download citation
DOI: https://doi.org/10.1007/11581116_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30018-2
Online ISBN: 978-3-540-32287-0
eBook Packages: Computer ScienceComputer Science (R0)