ELP: Tractable Rules for OWL 2

From korrekt.org

Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler

ELP: Tractable Rules for OWL 2

Abstract. We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL++, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL++ with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain range restrictions, and the universal role. We present a reasoning algorithm based on a translation of ELP to Datalog, and this translation also enables the seamless integration of DL-safe rules into ELP. While reasoning with DL-safe rules as such is already highly intractable, we show that DL-safe rules based on the Description Logic Programming (DLP) fragment of OWL 2 can be admitted in ELP without losing tractability.

Published at ISWC2008 (Conference paper)

Download PDF (last update: Oct 31 2008)

Citation details


A comprehensive treatment of description logic rules, including various updates on ELP, can be found in my dissertation.

The above PDF is the extended technical report. You can also download the camera ready ISWC paper which is a shortened version of the report.

You can also download the slides for the talk at ISWC.


Description logics, Rule languages