Michaël Thomazo

most citedWorst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses

2 citations · 5 across the 3 of their papers we have counts for

collaborators

3 papers

cs.LO2020★ 1 cited

Answering Counting Queries over DL-Lite Ontologies

Meghyn Bienvenu, Quentin Manière, Michaël Thomazo

Ontology-mediated query answering (OMQA) is a promising approach to data access and integration that has been actively studied in the knowledge representation and database communit…

cs.AI2014★ 2 cited

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…

cs.FL2014★ 2 cited

On $k$ -piecewise testability (preliminary report)

Tomáš Masopust, Michaël Thomazo

For a non-negative integer $k$ , a language is $k$ -piecewise test\-able ( $k$ -PT) if it is a finite boolean combination of languages of the form $Σ^{*} a_{1} Σ^{*} \dots Σ^{*} a_{n} Σ^{*}$ for…

Answering Counting Queries over DL-Lite Ontologies

Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses

On k-piecewise testability (preliminary report)

On $k$ -piecewise testability (preliminary report)