1462 search results - page 233 / 293 » Autoepistemic Description Logics |
TCS
2002
14 years 9 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
106
click to vote
DLOG
2010
14 years 8 months ago
2010
Abstract. Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion...
ICDIM
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we discuss the use of digital circuits in decision support systems. For this, it is first necessary to translate the descriptions of situations and conclusions whic...
107
click to vote
DLOG
2011
14 years 1 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
DLOG
2011
14 years 1 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...