Skip to main content

Approximate OWL-Reasoning with Screech

  • Conference paper
Web Reasoning and Rule Systems (RR 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5341))

Included in the following conference series:

Abstract

With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for inctreased reasoning speed, will help to deal with the high computational complexities which state of the art ontology reasoning tools have to face. In this paper, we present a comprehensive overview of the Screech approach to approximate reasoning with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity. We present three different instantiations of the Screech approach, and report on experiments which show that the gain in efficiency outweighs the number of introduced mistakes in the reasoning process.

Research reported in this paper was supported by the EU in the IST project NeOn (IST-2006-027595, http://www.neon-project.org/ ), by the Deutsche Forschungsgemeinschaft (DFG) under the ReaSem project, and by the the German Federal Ministry of Education and Research (BMBF) under the Theseus project, http://theseus-programm.de .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McGuinness, D.L., van Harmelen, F.: OWL web ontology language overview (2004), http://www.w3.org/TR/owl-features/

  2. Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description logic programs: Combining logic programs with description logics. In: Proc. of WWW 2003, Budapest, Hungary, May 2003, pp. 48–57. ACM, New York (2003)

    Google Scholar 

  3. Volz, R.: Web Ontology Reasoning with Logic Databases. PhD thesis, Institute AIFB, University of Karlsruhe (2004)

    Google Scholar 

  4. Krötzsch, M., Hitzler, P., Vrandecic, D., Sintek, M.: How to reason with OWL in a logic programming system. In: Eiter, T., Franconi, E., Hodgson, R., Stephens, S. (eds.) Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web, RuleML2006, Athens, Georgia, pp. 17–26. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  5. Krötzsch, M., Rudolph, S., Hitzler, P.: Description Logic Rules. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008). IOS Press, Amsterdam (to appear, 2008)

    Google Scholar 

  6. Krötzsch, M., Rudolph, S., Hitzler, P.: Elp: Tractable rules for OWL 2. In: Proceedings of the 7th International Semantic Web Conference (ISWC 2008) (to appear, 2008)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Universität Karlsruhe (2006)

    Google Scholar 

  9. Motik, B., Sattler, U.: A comparison of reasoning techniques for querying large description logic ABoxes. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246. Springer, Heidelberg (2006)

    Google Scholar 

  10. Hitzler, P., Vrandecic, D.: Resolution-based approximate reasoning for OWL DL. In: Gil, Y., et al. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 383–397. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Rudolph, S., Krötzsch, M., Hitzler, P., Sintek, M., Vrandecic, D.: Efficient OWL reasoning with logic programs – evaluations. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 370–373. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. Journal of the ACM 42, 741–843 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fensel, D., Harmelen, F.V.: Unifying reasoning and search to web scale. IEEE Internet Computing 11, 94–96 (2007)

    Article  Google Scholar 

  14. Stuckenschmidt, H., van Harmelen, F.: Approximating terminological queries. In: Larsen, H., et al. (eds.) FQAS 2002. LNCS (LNAI), vol. 2522. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. 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)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Wache, H., Groot, P., Stuckenschmidt, H.: Scalable instance retrieval for the semantic web by approximation. In: Dean, M., Guo, Y., Jun, W., Kaschek, R., Krishnaswamy, S., Pan, Z., Sheng, Q.Z. (eds.) WISE 2005 Workshops. LNCS, vol. 3807, pp. 245–254. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Pan, J.Z., Thomas, E.: Approximating OWL-DL ontologies. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, July 22-26, 2007, pp. 1434–1439. AAAI Press, Menlo Park (2007)

    Google Scholar 

  19. Stuckenschmidt, H.: Partial matchmaking using approximate subsumption. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, Vancouver, British Columbia, Canada, July 22-26, 2007, pp. 1459–1464. AAAI Press, Menlo Park (2007)

    Google Scholar 

  20. 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)

    Article  MathSciNet  MATH  Google Scholar 

  21. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. Journal of the ACM 42, 741–843 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Angele, J., Lausen, G.: Ontologies in F-logic. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies, pp. 29–50. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Selman, B., Kautz, H.A.: Knowledge compilation using horn approximations. In: Proc. 9th National Conference on Artificial Intelligence (AAAI 1991), pp. 904–909 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tserendorj, T., Rudolph, S., Krötzsch, M., Hitzler, P. (2008). Approximate OWL-Reasoning with Screech . In: Calvanese, D., Lausen, G. (eds) Web Reasoning and Rule Systems. RR 2008. Lecture Notes in Computer Science, vol 5341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88737-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88737-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88736-2

  • Online ISBN: 978-3-540-88737-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics