Data complexity in the ƐL family of description logics

Authors:
Adila Krisnadhi;Carsten Lutz
Affiliations:
Faculty of Computer Science, University of Indonesia;Institute for Theoretical Computer Science, TU Dresden, Germany
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 8
Cited 9

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
Boosting the correspondence between description logics and propositional dynamic logics

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
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
Pushing the EL envelope

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 query answering in the description logic EL using a relational database system

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Expressive approximations in DL-lite ontologies

AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity

Fundamenta Informaticae
View-based query answering in Description Logics: Semantics and complexity

Journal of Computer and System Sciences
Tractability and Intractability of Controlled Languages for Data Access

Studia Logica
Data complexity of query answering in description logics

Artificial Intelligence
Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP

Proceedings of the 32nd symposium on Principles of database systems
Conjunctive regular path queries in lightweight description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Computing datalog rewritings beyond horn ontologies

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability. We identify a large number of intractable extensions of EL, but also show that in ELIf, the extension of EL with inverse roles and global functionality, conjunctive query answering is tractable regarding data complexity. In contrast, already instance checking in EL extended with only inverse roles or global functionality is EXPTIME-complete regarding combined complexity.