ELP: Tractable Rules for OWL 2
From International Center for Computational Logic
ELP: Tractable Rules for OWL 2
Markus KrötzschMarkus Krötzsch, Sebastian RudolphSebastian Rudolph, Pascal HitzlerPascal Hitzler
Markus Krötzsch, Sebastian Rudolph, Pascal Hitzler
ELP: Tractable Rules for OWL 2
Technical Report, Institut AIFB, Universität Karlsruhe (TH), volume 1752, April 2008
ELP: Tractable Rules for OWL 2
Technical Report, Institut AIFB, Universität Karlsruhe (TH), volume 1752, April 2008
- KurzfassungAbstract
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. - Weitere Informationen unter:Further Information: Link, Link
- Forschungsgruppe:Research Group: Computational LogicComputational Logic, Wissensbasierte SystemeKnowledge-Based Systems
@techreport{KRH2008,
author = {Markus Kr{\"{o}}tzsch and Sebastian Rudolph and Pascal Hitzler},
title = {ELP: Tractable Rules for {OWL} 2},
institution = {Institut {AIFB,} Universit{\"{a}}t Karlsruhe (TH)},
year = {2008},
month = {April}
}