View source

From korrekt.org

for Complexity Boundaries for Horn Description Logics

You do not have permission to do that, for the following reason:

The action you have requested is limited to users in the group user.

You can view and copy the source of this page:

{{publication|
author1=Markus Krötzsch|
author2=Sebastian Rudolph|
author3=Pascal Hitzler|
title=Complexity Boundaries for Horn Description Logics|
where=AAAI2007|
booktitle=Proceedings of the 22nd AAAI Conference on Artficial Intelligence (AAAI-07)|
pages=452&ndash;457|
publisher=AAAI Press|
date=2007|
updated=August 22 2007|
type=Conference paper|
pdf=http://korrekt.org/papers/KroetzschRudolphHitzler_HornTR2007.pdf|
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 Horn-DLs. While the combined complexity for many Horn-DLs turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning.
}}

== Topics ==

[[topic::Description logics]]

Templates used on this page:

Return to Complexity Boundaries for Horn Description Logics.

Retrieved from "http://korrekt.org/page/Complexity_Boundaries_for_Horn_Description_Logics"

View source

From korrekt.org

Views

Personal tools

Navigation

Search

Toolbox