Towards RIF-OWL combination: An effective reasoning technique in integrating OWL and negation-free rules

Abstract

In this paper we focus on the combination of Description Logics (DLs) and negation-free rules, both expressed in the standard First-Order logic semantics. We propose an algorithm that is sound for every such combination but not complete. Our algorithm uses existing standard reasoning tools for retrieving facts from the DL Knowledge Base with which rules are put together to form a logic program. Rule reasoner is then used for answering queries in this program. We identify the reasons behind the incompleteness and chose a subset which combines restricted DL and rules. This subset consists of DL Horn- language and rules such that DL predicates are allowed only in the rule bodies and all the rules are DL-safe. A prototype implementation of the reasoning process is also presented. The combination chosen here can express strictly more information in the DL component compared to the well known combination DLP extended using rules. © 2011 Springer-Verlag.