Abstract
We propose a new technique for approximate ABox reasoning with OWL DL ontologies. Essentially, we obtain substantially improved reasoning performance by disregarding non-Horn features of OWL DL. Our approach comes as a side-product of recent research results concerning a new transformation of OWL DL ontologies into negation-free disjunctive datalog [1, 2, 3, 4], and rests on the idea of performing standard resolution over disjunctive rules by treating them as if they were non-disjunctive ones. We analyse our reasoning approach by means of non-monotonic reasoning techniques, and present an implementation, called Screech.
The authors acknowledge support by the German Federal Ministry of Education and Research (BMBF) under the SmartWeb project, and by the European Commission under contract IST-2003-506826 SEKT and under the KnowledgeWeb Network of Excellence. The expressed content is the view of the authors but not necessarily the view of any of the projects as a whole.
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
Hustadt, U., Motik, B., Sattler, U.: Reasoning for Description Logics around \(\mathcal{SHIQ}\) in a Resolution Framework. Technical Report 3-8-04/04, FZI, Karlsruhe, Germany (2004), http://www.fzi.de/wim/publikationen.php?id=1172
Hustadt, U., Motik, B., Sattler, U.: Reducing \({\mathcal SHIQ}^{-}\) Description Logic to Disjunctive Datalog Programs. In: Proc. of the 9th Conference on Knowledge Representation and Reasoning (KR 2004), AAAI Press, Menlo Park (2004)
Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics with a concrete domain in the framework of resolution. In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, pp. 353–357. IOS Press, Amsterdam (2004)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 549–563. Springer, Heidelberg (2004) (to appear)
W3C: Web ontology language, OWL (2004), http://www.w3.org/2004/OWL/
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, pp. 466–471 (2005)
Makinson, D.: Bridges from Classical to Nonmonotonic Logic. Texts in Computing, vol. 5. King’s College Publications, London (2005)
Horrocks, I., Patel-Schneider, P.F.: A Proposal for an OWL Rules Language. In: Proc. of the Thirteenth Int’l World Wide Web Conf(WWW 2004), ACM, New York (2004)
Lutz, C.: Description Logics with Concrete Domains — A Survey. In: Advances in Modal Logics, vol. 4. King’s College Publications (2003)
Horrocks, I., Sattler, U., Tobies, S.: Practical Reasoning for Very Expressive Description Logics. Logic Journal of the IGPL 8, 239–263 (2000)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)
Selman, B., Kautz, H.A.: Knowledge compilation using Horn approximations. In: Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI 1991), pp. 904–909. AAAI Press, Menlo Park (1991)
Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74, 249–310 (1995)
Dalal, M.: Anytime clausal reasoning. Annals of Mathematics and Artificial Intelligence 22, 297–318 (1998)
Cadoli, M., Scarcello, F.: Semantical and computational aspects of Horn approximations. Artificial Intelligence 119 (2000)
van Harmelen, F., ten Teije, A.: Describing problem solving methods using anytime performance profiles. In: Proceedings of ECAI 2000, Berlin, pp. 181–186 (2000)
Groot, P., ten Teije, A., van Harmelen, F.: Towards a structured analysis of approximate problem solving: a case study in classification. In: Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), Whistler, Colorado (2004)
Stuckenschmidt, H., van Harmelen, F.: Approximating terminological queries. In: Larsen, H., et al. (eds.) FQAS 2002. LNCS (LNAI), vol. 2522. Springer, Heidelberg (2002)
Horrocks, I., Li, L., Turi, D., Bechhofer, S.: The Instance Store: DL reasoning with large numbers of individuals. In: Proceedings of the International Workshop on Description Logics, DL 2004, Whistler, Canada, pp. 31–40 (2004)
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. LNCS, vol. 3532, pp. 318–332. Springer, Heidelberg (2005)
Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, Los Altos (1988)
Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)
Hitzler, P., Wendt, M.: A uniform approach to logic programming semantics. Theory and Practice of Logic Programming 5, 123–159 (2005)
Hitzler, P.: Towards a systematic account of different semantics for logic programs. Journal of Logic and Computation 15, 391–404 (2005)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265. Springer, Heidelberg (1997)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)
Sakama, C., Inoue, K.: An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning 13, 145–172 (1994)
Knorr, M.: Level mapping characterizations for quantitative and disjunctive logic programs. Bachelor’s Thesis, Department of Computer Science, Technische Universität Dresden, Germany (2003)
Volz, R.: Web Ontology Reasoning with Logic Databases. PhD thesis, AIFB, University of Karlsruhe (2004)
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
Hitzler, P., Vrandečić, D. (2005). Resolution-Based Approximate Reasoning for OWL DL. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds) The Semantic Web – ISWC 2005. ISWC 2005. Lecture Notes in Computer Science, vol 3729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11574620_29
Download citation
DOI: https://doi.org/10.1007/11574620_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29754-3
Online ISBN: 978-3-540-32082-1
eBook Packages: Computer ScienceComputer Science (R0)