Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large ABoxes. However, the natural question whether Horn-DLs also provide advantages for TBox reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of ...Expand abstract
- Copyright date:
Complexity Boundaries for Horn Description Logics.
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record