Michaël Thomazo
Cited by
Cited by
Walking the complexity lines for generalized guarded existential rules
JF Baget, ML Mugnier, S Rudolph, M Thomazo
IJCAI Proceedings-International Joint Conference on Artificial Intelligence …, 2011
Mixed-instance querying: a lightweight integration architecture for data journalism
R Bonaque, TD Cao, B Cautis, F Goasdoué, J Letelier, I Manolescu, ...
VLDB, 2016
Sound, complete and minimal UCQ-rewriting for existential rules
M König, M Leclère, ML Mugnier, M Thomazo
Semantic Web 6 (5), 451-475, 2015
An introduction to ontology-based query answering with existential rules
ML Mugnier, M Thomazo
Reasoning Web. Reasoning on the Web in the Big Data Era: 10th International …, 2014
Compact rewritings for existential rules
M Thomazo
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
A sound and complete backward chaining algorithm for existential rules
M König, M Leclere, ML Mugnier, M Thomazo
Web Reasoning and Rule Systems: 6th International Conference, RR 2012 …, 2012
A generic querying algorithm for greedy sets of existential rules
M Thomazo, JF Baget, ML Mugnier, S Rudolph
Thirteenth International Conference on the Principles of Knowledge …, 2012
Conjunctive query answering under existential rules-decidability, complexity, and algorithms
M Thomazo
Université Montpellier II-Sciences et Techniques du Languedoc, 2013
Complexity of universality and related problems for partially ordered NFAs
M Krötzsch, T Masopust, M Thomazo
Information and Computation 255, 177-192, 2017
On the exploration of the query rewriting space with existential rules
M König, M Leclère, ML Mugnier, M Thomazo
Web Reasoning and Rule Systems: 7th International Conference, RR 2013 …, 2013
Towards farsighted dependencies for existential rules
JF Baget, ML Mugnier, M Thomazo
International Conference on Web Reasoning and Rule Systems, 30-45, 2011
A single approach to decide chase termination on linear existential rules
M Leclère, ML Mugnier, M Thomazo, F Ulliana
22nd International Conference on Database Theory (ICDT 2019), 2019
Answering Conjunctive Regular Path Queries over Guarded Existential Rules.
JF Baget, M Bienvenu, ML Mugnier, M Thomazo
IJCAI, 793-799, 2017
On boolean combinations forming piecewise testable languages
T Masopust, M Thomazo
Theoretical Computer Science 682, 165-179, 2017
On the Complexity of k-Piecewise Testability and the Depth of Automata
T Masopust, M Thomazo
Developments in Language Theory: 19th International Conference, DLT 2015 …, 2015
Capturing homomorphism-closed decidable queries with existential rules
C Bourgaux, D Carral, M Krötzsch, S Rudolph, M Thomazo
arXiv preprint arXiv:2107.07811, 2021
Characterization of the Expressivity of Existential Rule Queries.
S Rudolph, M Thomazo
IJCAI, 3193-3199, 2015
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
ML Mugnier, G Simonet, M Thomazo
Information and Computation 215, 8-31, 2012
Revisiting semiring provenance for datalog
C Bourgaux, P Bourhis, L Peterfreund, M Thomazo
arXiv preprint arXiv:2202.10766, 2022
Reasoning about disclosure in data integration in the presence of source constraints
M Benedikt, P Bourhis, L Jachiet, M Thomazo
arXiv preprint arXiv:1906.00624, 2019
The system can't perform the operation now. Try again later.
Articles 1–20