1435 search results - page 105 / 287 » E-connections of Description Logics |
103
click to vote
ICDT
2003
ACM
15 years 6 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
ICFCA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
122
click to vote
ECSQARU
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we propose an approach for measuring inconsistency in inconsistent ontologies. We first define the degree of inconsistency of an inconsistent ontology using a four...
134
click to vote
TABLEAUX
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
137
click to vote
KR
2010
Springer
15 years 6 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...