Advertisement

On the Web Ontology Rule Language OWL 2 RL

  • Son Thanh Cao
  • Linh Anh Nguyen
  • Andrzej Szałas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6922)

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.

Keywords

Description Logic Unary Predicate Binary Predicate Datalog Program Negative Clause 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefGoogle Scholar
  3. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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. 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. 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. 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)CrossRefGoogle Scholar
  9. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 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. 12.
    Nguyen, L.A.: Horn knowledge bases in regular description logics with PTime data complexity. Fundamenta Informaticae 104(4), 349–384 (2010)MathSciNetzbMATHGoogle Scholar
  13. 13.
  14. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Son Thanh Cao
    • 1
  • Linh Anh Nguyen
    • 2
  • Andrzej Szałas
    • 2
    • 3
  1. 1.Faculty of Information TechnologyVinh UniversityNghe AnVietnam
  2. 2.Institute of InformaticsUniversity of WarsawWarsawPoland
  3. 3.Dept. of Computer and Information ScienceLinköping UniversityLinköpingSweden

Personalised recommendations