993 search results - page 1 / 199 » The Complexity of Probabilistic EL |
DLOG
2011
12 years 8 months ago
2011
We analyze the complexity of subsumption in probabilistic variants of the description logic EL. In the case where probabilities apply only to concepts, we map out the borderline be...
LPAR
2007
Springer
13 years 11 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
13 years 8 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
DLOG
2007
13 years 7 months ago
2007
DLOG
2010
13 years 2 months ago
2010
The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth boun...