Michaël Thomazo: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Michael Thomazo (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Michael Thomazo (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
| Zeile 10: | Zeile 10: | ||
|Email=michael.thomazo@tu-dresden.de | |Email=michael.thomazo@tu-dresden.de | ||
|Raum=INF 2036 | |Raum=INF 2036 | ||
|Bild=thomazo | |Bild=thomazo.JPG | ||
|Info=I graduated from MPRI in 2010 at the Ecole Normale Supérieure de Cachan, France. I then started a Ph.D. in knowledge representation and reasoning within the INRIA team GraphIK, based in Montpellier, at LIRMM, supervised jointly by Marie-Laure Mugnier and Jean-François Baget. My thesis, entitled “Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms”, focused on data access when taking general domain knowledge into account. I am now a post-doctoral research assistant at the Computational Logic Group at the TU Dresden, since October 2013, and an Alexander von Humboldt Fellow since July 2014. | |Info=I graduated from MPRI in 2010 at the Ecole Normale Supérieure de Cachan, France. I then started a Ph.D. in knowledge representation and reasoning within the INRIA team GraphIK, based in Montpellier, at LIRMM, supervised jointly by Marie-Laure Mugnier and Jean-François Baget. My thesis, entitled “Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms”, focused on data access when taking general domain knowledge into account. I am now a post-doctoral research assistant at the Computational Logic Group at the TU Dresden, since October 2013, and an Alexander von Humboldt Fellow since July 2014. | ||
|Info EN=I graduated from MPRI in 2010 at the Ecole Normale Supérieure de Cachan, France. I then started a Ph.D. in knowledge representation and reasoning within the INRIA team GraphIK, based in Montpellier, at LIRMM, supervised jointly by Marie-Laure Mugnier and Jean-François Baget. My thesis, entitled “Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms”, focused on data access when taking general domain knowledge into account. I am now a post-doctoral research assistant at the Computational Logic Group at the TU Dresden, since October 2013, and an Alexander von Humboldt Fellow since July 2014. | |Info EN=I graduated from MPRI in 2010 at the Ecole Normale Supérieure de Cachan, France. I then started a Ph.D. in knowledge representation and reasoning within the INRIA team GraphIK, based in Montpellier, at LIRMM, supervised jointly by Marie-Laure Mugnier and Jean-François Baget. My thesis, entitled “Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms”, focused on data access when taking general domain knowledge into account. I am now a post-doctoral research assistant at the Computational Logic Group at the TU Dresden, since October 2013, and an Alexander von Humboldt Fellow since July 2014. | ||
Version vom 4. November 2014, 19:41 Uhr
Dr. Michaël Thomazo
Stipendiat Computational Logic
- michael.thomazo@tu-dresden.de
- +49 351 463 43560
- +49 351 463 32827
- INF 2036
I graduated from MPRI in 2010 at the Ecole Normale Supérieure de Cachan, France. I then started a Ph.D. in knowledge representation and reasoning within the INRIA team GraphIK, based in Montpellier, at LIRMM, supervised jointly by Marie-Laure Mugnier and Jean-François Baget. My thesis, entitled “Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms”, focused on data access when taking general domain knowledge into account. I am now a post-doctoral research assistant at the Computational Logic Group at the TU Dresden, since October 2013, and an Alexander von Humboldt Fellow since July 2014.
Neueste Publikationen
Komplette Publikationsliste anzeigen
David Carral, Lukas Gerlach, Lucas Larroque, Michaël Thomazo
Restricted Chase Termination: You Want More than Fairness
Proc. ACM Manag. Data, 3(2 (PODS)), to appear
Details Download
Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo
Capturing Homomorphism-Closed Decidable Queries with Existential Rules
In Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem, eds., Proc. 18th International Conference on Principles of Knowledge Representation and Reasoning (KR'21), 141--150, 2021
Details Download
Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
Complexity of Universality and Related Problems for Partially Ordered NFAs
Information and Computation, 255(1):177-192, August 2017
Details Download
Tomáš Masopust, Michaël Thomazo
On boolean combinations forming piecewise testable languages
Theoretical Computer Science, 682:165-179, June 2017
Details Download
Sebastian Rudolph, Michaël Thomazo
Expressivity of Datalog Variants - Completing the Picture
In Subbarao Kambhampati, eds., Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'16), 1230-1236, July 2016. AAAI Press
Details Download
Markus Krötzsch, Tomáš Masopust, Michaël Thomazo
On the Complexity of Universality for Partially Ordered NFAs
In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, eds., Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), volume 58 of Leibniz International Proceedings in Informatics, 61:1--61:14, 2016. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Details Download
Sarah Alice Gaggl, Sebastian Rudolph, Michaël Thomazo
What Is a Reasonable Argumentation Semantics?
In Eiter, Thomas and Strass, Hannes and Truszczyński, Mirosław and Woltran, Stefan, eds., Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday, volume 9060 of Lecture Notes in Computer Science, chapter Abstract Argumentation, 309-324. Springer International Publishing, 2015
Details Download
Sebastian Rudolph, Michaël Thomazo
Characterization of the Expressivity of Existential Rule Queries
In Qiang Yang, Michael Wooldridge, eds., Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI'15), 3193-3199, 2015. AAAI Press
Details Download
Tomáš Masopust, Michaël Thomazo
On the Complexity of k-Piecewise Testability and the Depth of Automata
In I. Potapov, eds., Proc. 19th International Conference on Developments in Language Theory (DLT'15), volume 9168 of LNCS, 364-376, 2015. Springer
Details Download
Sebastian Rudolph, Michaël Thomazo
Characterization of the Expressivity of Existential Rule Queries
Technical Report, TU Dresden, volume IJCAI-15-RT-RR, May 2015
Details Download
