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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal article |
| Language: | English |
| Published: |
Springer
2008
|