Abstract
Although description logic systems can adequately be used for representing and reasoning about incomplete information (e.g., for John we know he is French or Italian), in practical applications it can be assumed that (only) for some tasks the expressivity of description logics really comes into play whereas for building complete applications, it is often necessary to effectively solve instance retrieval problems with respect to largely deterministic knowledge. In this paper we present and analyze the main results we have found about how to contribute to this kind of scalability problem. We assume familiarity with description logics in general and tableau provers in particular.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69, 5–40 (2001)
Baader, F., et al. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Bechhofer, S., Horrocks, I., Turi, D.: The OWL instance store: System description. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, Springer, Heidelberg (2005)
Calvanese, D., et al.: Data complexity of query answering in description logics. In: Proc. of the 2005 Description Logic Workshop (DL 2005). CEUR Electronic Workshop Proceedings (2005), http://ceur-ws.org/
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of the 17th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS’98), pp. 149–158 (1998)
Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems: The Complete Boook. Prentice-Hall, Englewood Cliffs (2092)
Glimm, B., Horrocks, I.: Handling cyclic conjunctive queries. In: Proc. of the 2005 Description Logic Workshop (DL 2005). CEUR Workshop Proceedings, vol. 147 (2005), http://ceur-ws.org/
Guo, Y., Heflin, J., Pan, Z.: Benchmarking DAML+OIL repositories. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 613–627. Springer, Heidelberg (2003)
Guo, Y., Pan, Z., Heflin, J.: An evaluation of knowledge base systems for large OWL datasets. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, Springer, Heidelberg (2004)
Haarslev, V., Möller, R.: Optimization techniques for retrieving resources described in OWL/RDF documents: First results. In: Ninth International Conference on the Principles of Knowledge Representation and Reasoning, KR 2004, Whistler, BC, Canada, June 2-5, 2004, pp. 163–173 (2004)
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, Springer, Heidelberg (2001)
Haarslev, V., Möller, R., Wessel, M.: The Description Logic \(\mathcal{ALCNH}_{R+}\) Extended with Concrete Domains: A Practically Motivated Approach. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 29–44. Springer, Heidelberg (2001)
Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester (1997)
Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). Technical report, University of Manchester (2006)
Horrocks, I., Tobies, S.: Reasoning with axioms: Theory and practice. In: Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000), pp. 285–296 (2000)
Horrocks, I., Sattler, U., Tobies, S.: Reasoning with individuals for the description logic \(\mathcal{SHIQ}\). In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 482–496. Springer, Heidelberg (2000)
Horrocks, I., Tessaris, S.: A conjunctive query language for description logic ABoxes. In: Proc. of the 17th Nat. Conf. on Artificial Intelligence (AAAI 2000), pp. 399–404 (2000)
Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univ. Karlsruhe (2006)
Motik, B., Volz, R., Maedche, A.: Optimizing query answering in description logics using disjunctive deductive databases. In: Proceedings of the 10th International Workshop on Knowledge Representation Meets Databases (KRDB-2003), pp. 39–50 (2003)
Wessel, M., Möller, R.: A high performance semantic web query answering engine. In: Proc. of the 2005 Description Logic Workshop (DL 2005). CEUR Electronic Workshop Proceedings (2005), http://ceur-ws.org/
Zhang, Z.: Ontology query languages for the semantic web: A performance evaluation. Master’s thesis, University of Georgia (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möller, R., Haarslev, V., Wessel, M. (2007). On the Scalability of Description Logic Instance Retrieval. In: Freksa, C., Kohlhase, M., Schill, K. (eds) KI 2006: Advances in Artificial Intelligence. KI 2006. Lecture Notes in Computer Science(), vol 4314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69912-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-69912-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69911-8
Online ISBN: 978-3-540-69912-5
eBook Packages: Computer ScienceComputer Science (R0)