Description logics (DLs) have a long tradition in computer science and knowledge
representation, being designed so that domain knowledge can be described and so that …

The aim of this paper is to introduce and study model-theoretic notions of modularity in
description logic and related reasoning problems. Our approach is based on a …

Learning description logic (DL) concepts from positive and negative examples given in the
form of labeled data items in a KB has received significant attention in the literature. We …

Abstract Defeasible Description Logics (DDLs) extend Description Logics with defeasible
concept inclusions. Reasoning in DDLs often employs rational closure according to the …

We study (i) uniform interpolation for TBoxes that are formulated in the lightweight
description logic EL and (ii) EL-approximations of TBoxes formulated in more expressive …

The question whether an ontology can safely be replaced by another, possibly simpler, one
is fundamental for many ontology engineering and maintenance tasks. It underpins, for …

Abstract Description logics (DLs) are a suitable formalism for representing knowledge about
domains in which objects are described not only by attributes but also by binary relations …

In ontology-based data access (OBDA), ontologies are used as an interface for querying
instance data. Since in typical applications the size of the data is much larger than the size of …

Finding a logical formula that separates positive and negative examples given in the form of
labeled data items is fundamental in applications such as concept learning, reverse …

Definite descriptions are phrases of the form'the $ x $ such that $\varphi $', used to refer to
single entities in a context. They are often more meaningful to users than individual names …