Abstract
Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies. For such applications, we conjectured that reusing ideas of deductive databases might improve scalability of DL systems. Hence, in our previous work, we developed an algorithm for reducing a DL knowledge base to a disjunctive datalog program. To test our conjecture, we implemented our algorithm in a new DL reasoner KAON2, which we describe in this paper. Furthermore, we created a comprehensive test suite and used it to conduct a performance evaluation. Our results show that, on knowledge bases with large ABoxes but with simple TBoxes, our technique indeed shows good performance; in contrast, on knowledge bases with large and complex TBoxes, existing techniques still perform better. This allowed us to gain important insights into strengths and weaknesses of both approaches.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic Paramodulation. Information and Computation 121(2), 172–192 (1995)
Bechhofer, S., Volz, R., Lord, P. W.: Cooking the Semantic Web with the OWL API. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 659–675. Springer, Heidelberg (2003)
Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the Magic-Set Method for Disjunctive Datalog Programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 371–385. Springer, Heidelberg (2004)
Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative problem-solving using the DLV system. Logic-Based Artificial Intelligence 79–103 (2000)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A Deductive System for Non-Monotonic Reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 364–375. Springer, Heidelberg (1997)
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, pp. 274–288. Springer, Heidelberg (2004)
Haarslev, V., Möller, R.: RACER System Description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 701–706. Springer, Heidelberg (2001)
Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, UK (1997)
Horrocks, I., Patel-Schneider, P.F.: Reducing OWL entailment to description logic satisfiability. Journal of Web Semantics 1(4), 345–357 (2004)
Horrocks, I., Sattler, U., Tobies, S.: Practical Reasoning for Very Expressive Description Logics. Logic Journal of the IGPL 8(3), 239–263 (2000)
Hustadt, U., Motik, B., Sattler, U.: Reducing SHIQ Description Logic to Disjunctive Datalog Programs. In: Proc. KR 2004, Whistler, Canada, June 2–5, pp. 152–162. AAAI Press, Menlo Park (2004)
Hustadt, U., Motik, B., Sattler, U.: Data Complexity of Reasoning in Very Expressive Description Logics. In: Proc. IJCAI 2005, Edinburgh, UK, July 30–August 5, 2005, pp. 466–471. Morgan Kaufmann Publishers, San Francisco (2005)
McCune, W.W.: OTTER 3.0 Reference Manual and Guide. Technical Report ANL-94/6, Argonne National Laboratory (January 1994)
Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univesität Karlsruhe, Germany (2006)
Nieuwenhuis, R., Rubio, A.: Theorem Proving with Ordering and Equality Constrained Clauses. Journal of Symbolic Computation 19(4), 312–351 (1995)
Parsia, B., Sirin, E.: Pellet: An OWL-DL Reasoner. Poster. In: Proc. ISWC 2004, Hiroshima, Japan, November 7–11 (2004)
Rector, A.L., Nowlan, W.A., Glowinski, A.: Goals for concept representation in the galen project. In: SCAMC 1993, Washington DC, USA, November 1-3, pp. 414–418. McGraw-Hill, New York (1993)
Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Communications 15(2–3), 91–110 (2002)
Schulz, S.: E—A Brainiac Theorem Prover. AI Communications 15(2–3), 111–126 (2002)
Schulz, S.: Simple and Efficient Clause Subsumption with Feature Vector Indexing. In: Proc. ESFOR, IJCAR 2004 Workshop, Cork, Ireland, July 4–8 (2004)
Tsarkov, D., Horrocks, I.: Ordering Heuristics for Description Logic Reasoning. In: Proc. IJCAI 2005, Edinburgh, UK, July 30 – August 5, pp. 609–614. Morgan Kaufmann Publishers, San Francisco (2005)
Volz, R.: Web Ontology Reasoning With Logic Databases. PhD thesis, Universität Fridericiana zu Karlsruhe (TH), Germany (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Motik, B., Sattler, U. (2006). A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes. In: Hermann, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2006. Lecture Notes in Computer Science(), vol 4246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11916277_16
Download citation
DOI: https://doi.org/10.1007/11916277_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48281-9
Online ISBN: 978-3-540-48282-6
eBook Packages: Computer ScienceComputer Science (R0)