ELP: Tractable Rules for OWL 2

Document Type

Conference Proceeding

Publication Date

10-1-2008

Find this in a Library

Catalog Record

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.

Comments

Presented at the 7th International Semantic Web Conference (ISWC), Karsruhe, Germany, October 26-30, 2008.

Also published as a Technical Report which can be found at http://corescholar.libraries.wright.edu/knoesis/443/.

DOI

10.1007/978-3-540-88564-1_41

Link to Full Text

Catalog Record

Share

COinS