ELP: Tractable Rules for OWL 2.
We introduce as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. is based on the tractable description logic , and encompasses an extended notion of the recently proposed DL rules for that logic. Thus extends 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 to Datalog, and ...Expand abstract
- Publisher copy:
- Copyright date: