Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$

Authors:
Thomas Eiter;Georg Gottlob;Magdalena Ortiz;Mantas Šimkus
Affiliations:
Institute of Information Systems, TU Vienna, Austria;Computing Laboratory, Oxford University, United Kingdom;Institute of Information Systems, TU Vienna, Austria;Institute of Information Systems, TU Vienna, Austria
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 11
Cited 14

On the decidability of query containment under constraints

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Optimized Reasoning in Description Logics Using Hypertableaux

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Complexity boundaries for horn description logics

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Worst-case optimal conjunctive query answering for an expressive description logic without inverses

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Terminological reasoning in SHIQ with ordered binary decision diagrams

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Terminological cycles in a description logic with existential restrictions

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A tableaux decision procedure for SHOIQ

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Data complexity of reasoning in very expressive description logics

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Conjunctive queries for a tractable fragment of OWL 1.1

ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference

Extending Carin to the Description Logics of the $\mathcal{SH}$ Family

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
DL - Lite and Role Inclusions

ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Reasoning Using Knots

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Query Answering in Description Logics: The Knots Approach

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Fusion of Logic Programming and Description Logics

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Well-founded semantics for description logic programs in the semantic web

ACM Transactions on Computational Logic (TOCL)
OWL and rules

RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Towards RIF-OWL combination: an effective reasoning technique in integrating OWL and negation-free rules

RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
Conjunctive query answering in the description logic SH using knots

Journal of Computer and System Sciences
Query answering in the horn fragments of the description logics SHOIQ and SROIQ

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Data complexity of query answering in description logics

Artificial Intelligence
First-order rewritability of atomic queries in horn description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology-based data access with closed predicates is inherently intractable (sometimes)

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an ExpTimealgorithm 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.