Complexity Boundaries for Horn Description Logics.
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 whe...
| Главные авторы: | , , |
|---|---|
| Формат: | Journal article |
| Язык: | English |
| Опубликовано: |
AAAI Press
2007
|