Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6922))

Included in the following conference series:

  • 1766 Accesses

Abstract

It is known that the OWL 2 RL Web Ontology Language Profile has PTime data complexity and can be translated into Datalog. However, a knowledge base in OWL 2 RL may be unsatisfiable. The reason is that, when translated into Datalog, the result may consist of a Datalog program and a set of constraints in the form of negative clauses. In this paper we first identify a maximal fragment of OWL 2 RL called OWL 2 RL +  with the property that every knowledge base expressed in this fragment can be translated into a Datalog program and hence is satisfiable. We then propose some extensions of OWL 2 RL and OWL 2 RL +  that still have PTime data complexity.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Cao, S.T., Nguyen, L.A., Szałas, A.: The long version of this paper (2011), Available at http://www.mimuw.edu.pl/~nguyen/owl2rl-long.pdf

  2. Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: A layered rule-based architecture for approximate knowledge fusion. Computer Science and Information Systems 7(3), 617–642 (2010)

    Article  Google Scholar 

  3. Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic. Int. J. Approx. Reasoning 51(3) (2010)

    Google Scholar 

  4. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R.: Well-founded semantics for description logic programs in the Semantic Web. ACM Trans. Comput. Log. 12(2), 11 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of WWW 2003, pp. 48–57 (2003)

    Google Scholar 

  6. Heymans, S., Eiter, T., Xiao, G.: Tractable reasoning with DL-programs over Datalog-rewritable description logics. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) Proceedings of ECAI 2010, pp. 35–40. IOS Press, Amsterdam (2010)

    Google Scholar 

  7. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proceedings of KR 2006, pp. 57–67. AAAI Press, Menlo Park (2006)

    Google Scholar 

  8. Madalińska-Bugaj, E., Nguyen, L.A.: Generalizing the QSQR evaluation method for Horn knowledge bases. In: Nguyen, N.T., Katarzyniak, R. (eds.) New Challenges in Applied Intelligence Technologies. Studies in Computational Intelligence, vol. 134, pp. 145–154. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Nguyen, L.A.: On the deterministic Horn fragment of test-free PDL. In: Hodkinson, I., Venema, Y. (eds.) Advances in Modal Logic, pp. 373–392. King’s College Publications (2006)

    Google Scholar 

  10. Nguyen, L.A.: Constructing finite least Kripke models for positive logic programs in serial regular grammar logics. Logic Journal of the IGPL 16(2), 175–193 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Nguyen, L.A.: Extending the description Horn logic DHL. In: Czaja, L., Szczuka, M. (eds.) Proceedings of CS&P 2009, pp. 419–430 (2009)

    Google Scholar 

  12. Nguyen, L.A.: Horn knowledge bases in regular description logics with PTime data complexity. Fundamenta Informaticae 104(4), 349–384 (2010)

    MathSciNet  MATH  Google Scholar 

  13. OWL 2 RL (2009), http://www.w3.org/TR/owl2-profiles/#OWL_2_RL

  14. ter Horst, H.J.: Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary. J. Web Sem. 3(2-3), 79–115 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao, S.T., Nguyen, L.A., Szałas, A. (2011). On the Web Ontology Rule Language OWL 2 RL. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23935-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23935-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23934-2

  • Online ISBN: 978-3-642-23935-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics