Ontologies and data management: a brief survey

T Schneider, M Šimkus - KI-Künstliche Intelligenz, 2020 - Springer
Abstract Information systems have to deal with an increasing amount of data that is
heterogeneous, unstructured, or incomplete. In order to align and complete data, systems …

Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model

L Giordano, D Theseider Dupré - … , JELIA 2021, Virtual Event, May 17–20 …, 2021 - Springer
In this paper we investigate the relationships between a multipreferential semantics for
defeasible reasoning in knowledge representation and a deep neural network model …

Probabilistic description logics under the distribution semantics

F Riguzzi, E Bellodi, E Lamma, R Zese - Semantic Web, 2015 - content.iospress.com
Representing uncertain information is crucial for modeling real world domains. In this paper
we present a technique for the integration of probabilistic information in Description Logics …

Carnap, Goguen, and the hyperontologies: Logical pluralism and heterogeneous structuring in ontology design

O Kutz, T Mossakowski, D Lücke - Logica Universalis, 2010 - Springer
This paper addresses questions of universality related to ontological engineering, namely
aims at substantiating (negative) answers to the following three basic questions:(i) Is there a …

Probabilistic description logics for subjective uncertainty

V Gutiérrez-Basulto, JC Jung, C Lutz… - Journal of Artificial …, 2017 - jair.org
We propose a family of probabilistic description logics (DLs) that are derived in a principled
way from Halpern's probabilistic first-order logic. The resulting probabilistic DLs have a two …

Ontology-Based Access to Probabilistic Data with OWL QL

JC Jung, C Lutz - The Semantic Web–ISWC 2012: 11th International …, 2012 - Springer
We propose a framework for querying probabilistic instance data in the presence of an
OWL2 QL ontology, arguing that the interplay of probabilities and ontologies is fruitful in …

Approximating probabilistic inference in statistical el with knowledge graph embeddings

Y Zhu, N Potyka, B Xiong, TK Tran, M Nayyeri… - arXiv preprint arXiv …, 2024 - arxiv.org
Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard.
We explain how knowledge graph embeddings can be used to approximate probabilistic …

Computing a possibility theory repair for partially preordered inconsistent ontologies

S Belabbes, S Benferhat - IEEE Transactions on Fuzzy …, 2021 - ieeexplore.ieee.org
We address the problem of handling inconsistency in uncertain knowledge bases that are
specified in the lightweight fragments of description logics DL-Lite. More specifically, we …

An extension of the ontology web language with multi-viewpoints and probabilistic reasoning

M Hemam - International Journal of Advanced Intelligence …, 2018 - inderscienceonline.com
A real world entity is unique, but it can have several representations due to various interests
or perspectives. In this paper, we are interested in the problem of multi-representation in …

Markov logic networks with numerical constraints

MW Chekol, J Huber, C Meilicke… - ECAI 2016, 2016 - ebooks.iospress.nl
Markov logic networks (MLNs) have proven to be useful tools for reasoning about
uncertainty in complex knowledge bases. In this paper, we extend MLNs with numerical …