How to reason with OWL in a logic programming system


Markus Krötzsch, Pascal Hitzler, Denny Vrandecic, Michael Sintek

How to reason with OWL in a logic programming system

Abstract. Logic programming has always been a major ontology modeling paradigm, and is frequently being used in large research projects and industrial applications, e.g., by means of the F-Logic reasoning engine OntoBroker or the TRIPLE query, inference, and transformation language and system. At the same time, the Web Ontology Language OWL has been recommended by the W3C for modeling ontologies for the web. Naturally, it is desirable to investigate the interoperability between both paradigms. In this paper, we do so by studying an expressive fragement of OWL DL for which reasoning can be reduced to the evaluation of Horn logic programs. Building on the KAON2 algorithms for transforming OWL DL into disjunctive Datalog, we give a detailed account of how and to what extent OWL DL can be employed in standard logic programming systems. En route, we derive a novel, simplified characterization of the supported fragment of OWL DL.

Published at RuleML2006 (Conference paper)

Download PDF (last update: November 1 2006)

Citation details


Those who are looking a simpler approach of reasoning with OWL in an LP system may want to look at works on rule-based inferencing in lightweight DLs. Relevant papers on this site include the work on Efficient Rule-Based Inferencing for OWL EL and related implementation in ELK. Another lightweight DL rule language is ELP.

A more comprehensive account of the complexity of Horn description logics is found in the article Complexities of Horn Description Logics.

An alternative way of translating DL reasoning problems to (disjunctive) Datalog that is completely different from KAON2 is described in the paper «Description Logic Reasoning with Decision Diagrams» (ISWC2008).


Description logics, Rule languages