54 search results - page 2 / 11 » el 2011 |
DLOG
2011
12 years 10 months ago
2011
Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
SIGPRO
2011
13 years 2 months ago
2011
DLOG
2011
12 years 10 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...
DLOG
2011
12 years 10 months ago
2011
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
TWC
2011
13 years 1 months ago
2011
—This paper presents two polynomial-complexity techniques for assigning Gray-like binary labels to arbitrary Grassmannian constellations. In the first technique, the constellati...