Uncertainty in Description Logics: a Lattice-based Approach

Proceedings of the 10th International Conference on Information Processing and Managment of Uncertainty in Knowledge-Based Systems, (IPMU-04).


Errata corrige:
To guarantee soundness and completeness of the calculus, we have to make the following restrictions. We assume that in the certainty lattice ${\cal L} = \langle {\cal T}, \preceq \rangle$ the set of certainty values ${\cal T}$ is \emph{finite}. From a practical point of view this is a limitation we can live with, especially taking into account that computers have finite resources, and thus, only a finite set of certainty values can be represented. In particular, this includes also the case of the the rational numbers in $[0,1]\cap \mathbb{Q}$ under a given fixed precision $p$ a computer can work with. Without it, the results presented in the paper do not hold.