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 …

The disjunctive skolem chase is a sound, complete, and potentially non-terminating
procedure for solving boolean conjunctive query entailment over knowledge bases of …

We present Nemo, a toolkit for rule-based reasoning and data processing that emphasises
robustness and ease of use. Nemo's core is a scalable and efficient main-memory reasoner …

The chase has become a staple of modern database theory with applications in data
integration, query optimisation, data exchange, ontology-based query answering, and many …

We extend the Datalog engine VLog to develop a column-oriented implementation of the
skolem and the restricted chase–two variants of a sound and complete algorithm used for …

Existential rules are a very popular ontology-mediated query language for which the chase
represents a generic computational approach for query answering. It is straightforward that …

We propose that modern existential rule reasoners can enable fully declarative
implementations of rule-based inference methods in knowledge representation, in the sense …

Existential rules, long known as tuple-generating dependencies in database theory, have
been intensively studied in the last decade as a powerful formalism to represent ontological …

We consider the issue of answering unions of conjunctive queries (UCQs) with disjunctive
existential rules and mappings. While this issue has already been well studied from a chase …

Existential rules are an expressive knowledge representation language mainly developed to
query data. In the literature, they are often supposed to be in some normal form that …