Journal article icon

Journal article

Complexity Boundaries for Horn Description Logics.

Abstract:

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

Actions


Authors


Publisher:
AAAI Press Publisher's website
Journal:
AAAI
Volume:
1
Pages:
452-457
Publication date:
2007-01-01
URN:
uuid:3e97cf3a-99a2-4bcd-aeee-3d2a0611b595
Source identifiers:
334603
Local pid:
pubs:334603
Language:
English

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP