Published: 2008 April
Institution: Institut AIFB, Universität Karlsruhe (TH)
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.
Download: Media:2008_1752_Krötzsch_ELP: Tractable _1.pdf
Weitere Informationen unter: Link
Beschreibungslogik, Deduktive Datenbanken, Komplexitätstheorie, Logik, Logikprogrammierung, Semantic Web