Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Query Answering in the Description Logic Horn-
verfasst von : Thomas Eiter, Georg Gottlob, Magdalena Ortiz, Mantas Šimkus
Erschienen in: Logics in Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We provide an
ExpTime
algorithm for answering conjunctive queries (CQs) in
Horn
-
$\mathcal{SHIQ}$
, a Horn fragment of the well-known Description Logic
$\mathcal{SHIQ}$
underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for
Horn
-
$\mathcal{SHIQ}$
; the queries are answered by reasoning over the domino system. Our algorithm not only shows that CQ answering in
Horn
-
$\mathcal{SHIQ}$
is not harder than satisfiability testing, but also that it is polynomial in data complexity, making
Horn
-
$\mathcal{SHIQ}$
an attractive expressive Description Logic.