LiU Electronic Press
Full-text not available in DiVA
Author:
Cao, Son Thanh (Vinh University, Vietnam)
Nguyen, Anh Linh (Institute of Informatics, Warsaw University)
Szalas, Andrzej (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
On the Web Ontology Rule Language OWL 2 RL
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI)
Editor:
Piotr Jedrzejowicz, Ngoc Thanh Nguyen and Kiem Hoang
Conference:
Computational Collective Intelligence. Technologies and Applications
Publisher: Springer Berlin/Heidelberg
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 6922
Pages:
254-264
Year of publ.:
2011
URI:
urn:nbn:se:liu:diva-72697
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-72697
ISBN:
978-3-642-23934-2
Subject category:
Computer Science
Abstract(en) :

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.

Available from:
2011-12-05
Created:
2011-12-05
Last updated:
2012-01-24
Statistics:
51 hits