8 search results - page 1 / 2 » Data Complexity in the EL family of DLs |
DLOG
2007
14 years 1 months ago
2007
LPAR
2007
Springer
14 years 5 months ago
2007
Springer
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...
KR
2010
Springer
14 years 3 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
AAAI
2010
14 years 9 days ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
JAPLL
2010
13 years 9 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...