25 citations · 47 across the 12 of their papers we have counts for
14 papers
Answering Path Queries under Linear and Guarded Existential Rules
Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier +1
Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology. While most work in the…
Analysing Temporal Reasoning in Description Logics Using Formal Grammars
Camille Bourgaux, Anton Gnatenko, Michaël Thomazo
We establish a correspondence between (fragments of) , a temporal extension of the description logic with the LTL operator , and…
Normalisations of Existential Rules: Not so Innocuous!
David Carral, Lucas Larroque, Marie-Laure Mugnier +1
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 simp…
Revisiting Semiring Provenance for Datalog
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund +1
Data provenance consists in bookkeeping meta information during query evaluation, in order to enrich query results with their trust level, likelihood, evaluation cost, and more. Th…
Capturing Homomorphism-Closed Decidable Queries with Existential Rules
Camille Bourgaux, David Carral, Markus Krötzsch +2
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 tha…
Parallelisable Existential Rules: a Story of Pieces
Maxime Buron, Marie-Laure Mugnier, Michaël Thomazo
In this paper, we consider existential rules, an expressive formalism well suited to the representation of ontological knowledge and data-to-ontology mappings in the context of ont…
Reasoning about disclosure in data integration in the presence of source constraints
Michael Benedikt, Pierre Bourhis, Louis Jachiet +1
Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings. Data sources often co…
A Single Approach to Decide Chase Termination on Linear Existential Rules
Michel Leclere, Marie-Laure Mugnier, Michael Thomazo +1
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…
On the Height of Towers of Subsequences and Prefixes
Štěpán Holub, Tomáš Masopust, Michaël Thomazo
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of word…
Complexity of Universality and Related Problems for Partially Ordered NFAs
Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form o…
Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses
Sebastian Rudolph, Michaël Thomazo, Jean-François Baget +1
The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in t…
On -piecewise testability (preliminary report)
Tomáš Masopust, Michaël Thomazo
For a non-negative integer , a language is -piecewise test\-able (-PT) if it is a finite boolean combination of languages of the form for…
Alternating Towers and Piecewise Testable Separators
Štěpán Holub, Tomáš Masopust, Michaël Thomazo
Two languages are separable by a piecewise testable language if and only if there exists no infinite tower between them. An infinite tower is an infinite sequence of strings altern…
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules
Mélanie König, Michel Leclère, Marie-Laure Mugnier +1
We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewr…