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 …

The core chase, a popular algorithm for answering conjunctive queries (CQs) over
existential rules, is guaranteed to terminate and compute a finite universal model whenever …

To reason with existential rules (aka tuple-generating dependencies), one often computes
universal models. Among the many such models of different structure and cardinality, the …

Ontology-based query answering with existential rules is well understood and implemented
for positive queries, in particular conjunctive queries. For queries with negation, however …

Ontology-based access to large data-sets has recently gained a lot of attention. To access
data efficiently, one approach is to rewrite the ontology into Datalog, and then use powerful …

Two main families of ontology languages are considered in the context of data access,
namely Horn description logics and existential rules. In this paper, we review the semantic …

Many approaches to query answering in Description Logics (DLs) adopt the certain answer
semantics, which is natural for standard query languages without negation, but falls short …

The general context of this work is the issue of designing high-quality systems that integrate
multiple data sources via a semantic layer encoded in a knowledge representation and …

Ontology-mediated query answering is a popular paradigm for enriching answers to user
queries with background knowledge. For querying the absence of information, however …

The chase is a well studied sound and complete algorithm for computing universal models
of knowledge bases that consist of an existential rule set and a set of facts. Since universal …