Geometric Models for (Temporally) Attributed Description Logics

08/27/2021
by   Camille Bourgaux, et al.
0

In the search for knowledge graph embeddings that could capture ontological knowledge, geometric models of existential rules have been recently introduced. It has been shown that convex geometric regions capture the so-called quasi-chained rules. Attributed description logics (DL) have been defined to bridge the gap between DL languages and knowledge graphs, whose facts often come with various kinds of annotations that may need to be taken into account for reasoning. In particular, temporally attributed DLs are enriched by specific attributes whose semantics allows for some temporal reasoning. Considering that geometric models and (temporally) attributed DLs are promising tools designed for knowledge graphs, this paper investigates their compatibility, focusing on the attributed version of a Horn dialect of the DL-Lite family. We first adapt the definition of geometric models to attributed DLs and show that every satisfiable ontology has a convex geometric model. Our second contribution is a study of the impact of temporal attributes. We show that a temporally attributed DL may not have a convex geometric model in general but we can recover geometric satisfiability by imposing some restrictions on the use of the temporal attributes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2020

Defeasible reasoning in Description Logics: an overview on DL^N

DL^N is a recent approach that extends description logics with defeasibl...
research
05/22/2019

A Note on Reasoning on DL-Lite_ R with Defeasibility

Representation of defeasible information is of interest in description l...
research
01/09/2013

A Distance-based Paraconsistent Semantics for DL-Lite

DL-Lite is an important family of description logics. Recently, there is...
research
08/06/2018

Metric Temporal Extensions of DL-Lite and Interval-Rigid Names

The DL-Lite description logics allow for modeling domain knowledge on to...
research
06/28/2021

Reasoning on DL-Lite_ R with Defeasibility in ASP

Reasoning on defeasible knowledge is a topic of interest in the area of ...
research
02/26/2015

Relaxation-based revision operators in description logics

As ontologies and description logics (DLs) reach out to a broader audien...
research
08/17/2020

Automated Reasoning in Temporal DL-Lite

This paper investigates the feasibility of automated reasoning over temp...

Please sign up or login with your details

Forgot password? Click here to reset