Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Distributed Description Logics (DDLs) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping (bridge rules). DDLs capture ...
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
Simona Colucci, Eugenio Di Sciascio, Francesco M. ...
The last decade of basic research in the area of Description Logics (DL) has created a stable theory, efficient inference procedures, and has demonstrated a wide applicability of ...
The purpose of this appendix is to introduce (in a compact manner) the syntax and semantics of the most prominent DLs occurring in this handbook. More information and explanations...