Abstract Knowledge graphs are crucial assets for tasks like query answering or data
integration. These tasks can be viewed as reasoning problems, which in turn require …

Abstract The project “Semantic Technologies for Situation Awareness” was concerned with
detecting certain critical situations from data obtained by observing a complex hard-and …

Guarded tuple-generating dependencies (GTGDs) are a natural extension of description
logics and referential constraints. It has long been known that queries over GTGDs can be …

Especially in data-intensive settings, a promising reasoning approach for description logics
(DLs) is to rewrite DL theories into sets of rules. Although many such approaches have been …

Automated reasoning support is an important aspect of logic-based knowledge
representation. The development of specialised procedures and sophisticated optimisation …

Ontology-based query answering is a problem that takes as input an ontology R (in our
context, a set of existential rules), a set F of facts, and a Boolean conjunctive query (CQ) q …

Nominal schemas have been proposed as an extension to Description Logics (DL), the
knowledge representation paradigm underlying the Web Ontology Language (OWL). They …

We propose using rule languages to encode complex reasoning algorithms in a declarative
way. This approach—which follows the classical slogan “Algorithm= Logic+ Control” …

Classically, consecutive updates on materialized datasets, obtained by computing every
consequence for given inference rules, are considered separately without any direct …

Automated reasoning support is an important aspect of logic-based knowledge
representation. The development of specialised procedures and sophisticated optimisation …