Skip to main content
SpringerLink
Log in
Book cover

Transactions on Computational Intelligence XIII pp 152–175Cite as

The Web Ontology Rule Language OWL 2 RL +  and Its Extensions

  • Chapter

  • 1598 Accesses

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 8342))

Abstract

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

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley (1995)

    Google Scholar 

  2. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of IJCAI 2005, pp. 364–369. Morgan-Kaufmann Publishers (2005)

    Google Scholar 

  3. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope further. In: Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)

    Google Scholar 

  4. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of ECAI 2004, pp. 298–302. IOS Press (2004)

    Google Scholar 

  5. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  6. Cao, S.T., Nguyen, L.A., Szałas, A.: On the Web ontology rule language OWL 2 RL. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS, vol. 6922, pp. 254–264. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Cao, S.T., Nguyen, L.A., Szałas, A.: WORL: A Web ontology rule language. In: Proceedings of KSE 2011, pp. 32–39. IEEE (2011)

    Google Scholar 

  8. Cao, S.T., Nguyen, L.A., Szałas, A.: WORL: a Nonmonotonic Rule Language for the Semantic Web. Vietnam Journal of Computer Science 1 (2013)

    Google Scholar 

  9. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating Datalog and description logics. J. Intell. Inf. Syst. 10(3), 227–252 (1998)

    Article  Google Scholar 

  10. Drabent, W., Małuszyński, J.: Well-founded semantics for hybrid rules. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 1–15. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

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

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

  13. Dunin-Kęplicz, B., Nguyen, L.A., Szałas, A.: Horn-TeamLog: A Horn fragment of TeamLog with PTime data complexity. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds.) ICCCI 2013. LNCS, vol. 8083, pp. 143–153. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. 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  Google Scholar 

  15. Elenius, D.: SWRL-IQ: A prolog-based query tool for OWL and SWRL. In: Proceedings of OWL ED Workshop (2012)

    Google Scholar 

  16. Motik, B., et al. (eds), Horrocks, I., et al. (contributors): OWL 2 Web Ontology Language Direct Semantics (2009), http://www.w3.org/TR/2009/REC-owl2-direct-semantics-20091027

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

  18. 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 (2010)

    Google Scholar 

  19. 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 (2006)

    Google Scholar 

  20. Horrocks, I., Patel-Schneider, P.F., Bechhofer, S., Tsarkov, D.: OWL rules: A proposal and prototype implementation. J. Web Sem. 3(1), 23–40 (2005)

    Article  Google Scholar 

  21. Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive Datalog. J. Autom. Reasoning 39(3), 351–384 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Knorr, M., Alferes, J.J., Hitzler, P.: A coherent well-founded model for hybrid MKNF knowledge bases. In: Proceedings of ECAI 2008. Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 99–103. IOS Press (2008)

    Google Scholar 

  23. Krisnadhi, A., Lutz, C.: Data complexity in the EL family of description logics. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 333–347. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for Horn description logics. In: Proceedings of AAAI 2007, pp. 452–457. AAAI Press (2007)

    Google Scholar 

  25. Krötzsch, M., Rudolph, S., Hitzler, P.: Conjunctive queries for a tractable fragment of OWL 1.1. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., Cudré-Mauroux, P. (eds.) ASWC 2007 and ISWC 2007. LNCS, vol. 4825, pp. 310–323. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104(1-2), 165–209 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  27. Madalińska-Bugaj, E., Nguyen, L.A.: A generalized QSQR evaluation method for Horn knowledge bases. ACM Trans. Comput. Log. 13(4), 32 (2012)

    MathSciNet  Google Scholar 

  28. Motik, B., Rosati, R.: Reconciling description logics and rules. J. ACM 57(5) (2010)

    Google Scholar 

  29. Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Sem. 3(1), 41–60 (2005)

    Article  Google Scholar 

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

    Google Scholar 

  31. 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  MATH  MathSciNet  Google Scholar 

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

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

    MATH  MathSciNet  Google Scholar 

  34. Nguyen, L.A., Cao, S.T.: Query-subquery nets. In: Nguyen, N.-T., Hoang, K., Jędrzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol. 7653, pp. 239–248. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  35. Nguyen, L.A., Nguyen, T.-B.-L., Szałas, A.: Horn-DL: An expressive Horn description logic with PTime data complexity. In: Faber, W., Lembo, D. (eds.) RR 2013. LNCS, vol. 7994, pp. 259–264. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  36. Nguyen, L.A., Nguyen, T.-B.-L., Szałas, A.: On Horn knowledge bases in regular description logic with inverse. In: Huynh, V.N., Denoeux, T., Tran, D.H., Le, A.C., Pham, B.S. (eds.) KSE 2013, Part I. AISC, vol. 244, pp. 37–50. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  37. Nguyen, L.A., Szałas, A.: On the Horn fragments of serial regular grammar logics with converse. In: Proceedings of KES-AMSTA 2013. Frontiers in Artificial Intelligence and Applications, vol. 252, pp. 225–234. IOS Press (2013)

    Google Scholar 

  38. Ortiz, M., Rudolph, S., Simkus, M.: Query answering in the Horn fragments of the description logics SHOIQ and SROIQ. In: Walsh, T. (ed.) Proceedings of IJCAI 2011, pp. 1039–1044 (2011)

    Google Scholar 

  39. http://www.w3.org/TR/owl2-syntax/#Datatype_Restrictions

  40. In: Motik, B., et al. (ed.), Calvanese, D., et al. (contributors): OWL 2 Web Ontology Language Profiles (2009), http://www.w3.org/TR/owl2-profiles/#OWL_2_RL http://www.w3.org/TR/owl2-profiles

  41. Rosati, R.: On conjunctive query answering in \(\mathcal{EL}\). In: Proceedings of DL 2007, pp. 451–458 (2007)

    Google Scholar 

  42. Rosati, R.: DL+log: Tight integration of description logics and disjunctive Datalog. In: Proceedings of KR 2006, pp. 68–78. AAAI Press (2006)

    Google Scholar 

  43. 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  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology, Vinh University, 182 Le Duan street, Vinh, Nghe An, Vietnam

    Son Thanh Cao

  2. Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Son Thanh Cao, Linh Anh Nguyen & Andrzej Szałas

  3. Faculty of Information Technology, VNU University of Engineering and Technology, 144 Xuan Thuy, Hanoi, Vietnam

    Linh Anh Nguyen

  4. Dept. of Computer and Information Science, Linköping University, SE-581 83, Linköping, Sweden

    Andrzej Szałas

Authors
  1. Son Thanh Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linh Anh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Szałas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, Wrocław University of Technology, Wrocław, Poland

    Ngoc-Thanh Nguyen

  2. Laboratory of Theoretical and Applied Computer Science, University of Lorraine, 57045, Metz Cedex, France

    Hoai An Le-Thi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Cao, S.T., Nguyen, L.A., Szałas, A. (2014). The Web Ontology Rule Language OWL 2 RL +  and Its Extensions. In: Nguyen, NT., Le-Thi, H.A. (eds) Transactions on Computational Intelligence XIII. Lecture Notes in Computer Science, vol 8342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54455-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54455-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54454-5

  • Online ISBN: 978-3-642-54455-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation