DL - Lite and Role Inclusions

Authors:
Roman Kontchakov;Michael Zakharyaschev
Affiliations:
School of Computer Science and Information Systems, Birkbeck College London, UK;School of Computer Science and Information Systems, Birkbeck College London, UK
Venue:
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Year:
2008

Citing 11
Cited 0

CLASSIC: a structural data model for objects

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
On the complexity of the instance checking problem in concept languages with existential quantification

Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Portrait of the Semantic Web in Action

IEEE Intelligent Systems
Theory of Computation (Texts in Computer Science)

Theory of Computation (Texts in Computer Science)
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog

Journal of Automated Reasoning
Query Answering in the Description Logic Horn-$\mathcal{SHIQ}$

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
DL-Lite: tractable description logics for ontologies

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
DL-lite in the light of first-order logic

AAAI'07 Proceedings of the 22nd 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a classification of the complexity of DL-Lite logics extended with role inclusion axioms. We show that the data complexity of instance checking becomes P -hard in the presence of functionality constraints, and coNP -hard if arbitrary number restrictions are allowed, even with primitive concept inclusions. The combined complexity of satisfiability in this case jumps to ExpTime . On the other side, the combined complexity for the logics without number restrictions depends only on the form of concept inclusions and can range from NLogSpace and P to NP; the data complexity for such logics stays in LogSpace .