LPAR   2007 Logic for Programming
Wall of Fame | Most Viewed LPAR-2007 Paper
14 years 20 days ago
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...
Adila Krisnadhi, Carsten Lutz
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source196
2Download preprint from source184
3Download preprint from source165
4Download preprint from source160
5Download preprint from source153
6Download preprint from source147
7Download preprint from source135
8Download preprint from source131
9Download preprint from source129
10Download preprint from source124
11Download preprint from source122
12Download preprint from source119
13Download preprint from source117
14Download preprint from source116
15Download preprint from source114
16Download preprint from source114
17Download preprint from source112
18Download preprint from source111
19Download preprint from source109
20Download preprint from source95
21Download preprint from source94
22Download preprint from source91
23Download preprint from source77