Data Complexity in the EL Family of Description Logics


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 ELI , 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.

DOI: 10.1007/978-3-540-75560-9_25

Extracted Key Phrases

5 Figures and Tables

Citations per Year

97 Citations

Semantic Scholar estimates that this publication has 97 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Krisnadhi2007DataCI, title={Data Complexity in the EL Family of Description Logics}, author={Adila Krisnadhi and Carsten Lutz}, booktitle={LPAR}, year={2007} }