Marie-Laure Mugnier

A Single Approach to Decide Chase Termination on Linear Existential Rules

2019 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

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 knowledge in the context of ontology-based query answering. A knowledge …

Reformulation-Based Query Answering for RDF Graphs with RDFS Ontologies

2019 · Lecture notes in computer science

Query answering in RDF knowledge bases has traditionally been performed either through graph saturation, i.e., adding all implicit triples to the graph, or through query reformulation, i.e., modifying the query to look for the explicit …

Parallelisable Existential Rules: a Story of Pieces

2021

In this paper, we consider existential rules, an expressive formalism well adapted to the representation of ontological knowledge, as well as data-to-ontology mappings in the context of ontology-based data integration. The chase is a fundamental …

Normalisations of Existential Rules: Not so Innocuous!

2022 · arXiv (Cornell University)

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 simplifies technical developments. For instance, a common assumption …