Michaël Thomazo
Michaël Thomazo
Adresse e-mail validée de inria.fr - Page d'accueil
TitreCitée parAnnée
Walking the complexity lines for generalized guarded existential rules
JF Baget, ML Mugnier, S Rudolph, M Thomazo
Twenty-Second International Joint Conference on Artificial Intelligence, 2011
1242011
Multi-agent path finding with kinematic constraints
W Hönig, TKS Kumar, L Cohen, H Ma, H Xu, N Ayanian, S Koenig
Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016
642016
A sound and complete backward chaining algorithm for existential rules
M König, M Leclere, ML Mugnier, M Thomazo
International Conference on Web Reasoning and Rule Systems, 122-138, 2012
392012
Compact rewritings for existential rules
M Thomazo
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
332013
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
262012
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
242015
Mixed-instance querying: a lightweight integration architecture for data journalism
R Bonaque, TD Cao, B Cautis, F Goasdoué, J Letelier, I Manolescu, ...
Proceedings of the VLDB Endowment 9 (13), 1513-1516, 2016
202016
An introduction to ontology-based query answering with existential rules
ML Mugnier, M Thomazo
Reasoning Web International Summer School, 245-278, 2014
182014
On the exploration of the query rewriting space with existential rules
M König, M Leclère, ML Mugnier, M Thomazo
International Conference on Web Reasoning and Rule Systems, 123-137, 2013
172013
Towards farsighted dependencies for existential rules
JF Baget, ML Mugnier, M Thomazo
International Conference on Web Reasoning and Rule Systems, 30-45, 2011
172011
Conjunctive Query Answering Under Existential Rules-Decidability, Complexity, and Algorithms
M Thomazo
112013
On boolean combinations forming piecewise testable languages
T Masopust, M Thomazo
Theoretical Computer Science 682, 165-179, 2017
92017
On the complexity of k-piecewise testability and the depth of automata
T Masopust, M Thomazo
International Conference on Developments in Language Theory, 364-376, 2015
92015
Alternating towers and piecewise testable separators
Š Holub, T Masopust, M Thomazo
arXiv preprint arXiv:1409.3943, 2014
92014
Mixing Materialization and Query Rewriting for Existential Rules.
M Thomazo, S Rudolph
ECAI, 897-902, 2014
72014
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
72012
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
72012
Complexity boundaries for generalized guarded existential rules
JF Baget, ML Mugnier, S Rudolph, M Thomazo
72011
Characterization of the expressivity of existential rule queries
S Rudolph, M Thomazo
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
62015
Complexity of universality and related problems for partially ordered NFAs
M Krötzsch, T Masopust, M Thomazo
Information and Computation 255, 177-192, 2017
52017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20