On the web ontology rule language OWL 2 RL

  • Authors:

  • Son Thanh Cao;Linh Anh Nguyen;Andrzej Szałas

  • Affiliations:

  • Faculty of Information Technology, Vinh University, Vinh, Nghe An, Vietnam;Institute of Informatics, University of Warsaw, Warsaw, Poland;Institute of Informatics, University of Warsaw, Warsaw, Poland and Dept. of Computer and Information Science, Linköping University, Linköping, Sweden

  • Venue:
  • ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.