Cao, Son Thanh Nguyen, Anh Linh Szalas, Andrzej 2011 (English)In: Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI) / [ed] Piotr Jedrzejowicz, Ngoc Thanh Nguyen and Kiem Hoang, Springer Berlin/Heidelberg, 2011, 254-264Konferensbidrag (Refereed)
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.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 6922
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-72697 (URN)10.1007/978-3-642-23935-9_25 (DOI)978-3-642-23934-2 (ISBN)oai:DiVA.org:liu-72697 (OAI)
Computational Collective Intelligence. Technologies and Applications