default search action
Michaël Thomazo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b2]Michaël Thomazo:
Ontology-Based Query Answering: Expressivity and Extensions. (Interrogation de données au travers d'une ontologie: expressivité et extensions). École Normale Supérieure, Paris, France, 2023 - 2022
- [c33]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Complexity Landscape for Counting Queries (Extended Abstract). Description Logics 2022 - [c32]Camille Bourgaux
, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo:
Capturing Homomorphism-Closed Decidable Queries with Existential Rules (Extended Abstract). IJCAI 2022: 5269-5273 - [c31]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Counting Queries over ELHI⊥ Ontologies. KR 2022 - [c30]Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michaël Thomazo:
Revisiting Semiring Provenance for Datalog. KR 2022 - [c29]David Carral, Lucas Larroque, Marie-Laure Mugnier, Michaël Thomazo:
Normalisations of Existential Rules: Not so Innocuous! KR 2022 - [i13]Camille Bourgaux
Revisiting Semiring Provenance for Datalog. CoRR abs/2202.10766 (2022) - [i12]David Carral, Lucas Larroque, Marie-Laure Mugnier, Michaël Thomazo:
Normalisations of Existential Rules: Not so Innocuous! CoRR abs/2206.03124 (2022) - 2021
- [c28]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Counting Queries over ELHI⊥ Ontologies. Description Logics 2021 - [c27]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Cardinality Queries over DL-Lite Ontologies (Extended abstract). Description Logics 2021 - [c26]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Cardinality Queries over DL-Lite Ontologies. IJCAI 2021: 1801-1807 - [c25]Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph
Capturing Homomorphism-Closed Decidable Queries with Existential Rules. KR 2021: 141-150 - [c24]Maxime Buron, Marie-Laure Mugnier, Michaël Thomazo:
Parallelisable Existential Rules: a Story of Pieces. KR 2021: 162-173 - [i11]Maxime Buron
Parallelisable Existential Rules: a Story of Pieces. CoRR abs/2107.06054 (2021) - [i10]Camille Bourgaux
Capturing Homomorphism-Closed Decidable Queries with Existential Rules. CoRR abs/2107.07811 (2021) - 2020
- [c23]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Answering Counting Queries over DL-Lite Ontologies (Extended Abstract). Description Logics 2020 - [c22]Meghyn Bienvenu, Quentin Manière
Answering Counting Queries over DL-Lite Ontologies. IJCAI 2020: 1608-1614 - [i9]Meghyn Bienvenu, Quentin Manière, Michaël Thomazo:
Answering Counting Queries over DL-Lite Ontologies. CoRR abs/2009.09801 (2020)
2010 – 2019
- 2019
- [j6]Stepan Holub, Tomás Masopust
On the height of towers of subsequences and prefixes. Inf. Comput. 265: 77-93 (2019) - [c21]Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, Federico Ulliana:
A Single Approach to Decide Chase Termination on Linear Existential Rules. ICDT 2019: 18:1-18:19 - [c20]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo:
Reasoning about Disclosure in Data Integration in the Presence of Source Constraints. IJCAI 2019: 1551-1557 - [i8]Michael Benedikt, Pierre Bourhis, Louis Jachiet, Michaël Thomazo:
Reasoning about disclosure in data integration in the presence of source constraints. CoRR abs/1906.00624 (2019) - 2018
- [c19]Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo, Federico Ulliana:
A Single Approach to Decide Chase Termination on Linear Existential Rules. Description Logics 2018 - [i7]Michel Leclère, Marie-Laure Mugnier
A Single Approach to Decide Chase Termination on Linear Existential Rules. CoRR abs/1810.02132 (2018) - 2017
- [j5]Markus Krötzsch, Tomás Masopust
Complexity of universality and related problems for partially ordered NFAs. Inf. Comput. 255: 177-192 (2017) - [j4]Tomás Masopust
On Boolean combinations forming piecewise testable languages. Theor. Comput. Sci. 682: 165-179 (2017) - [c18]Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier, Michaël Thomazo:
Answering Conjunctive Regular Path Queries over Guarded Existential Rules. IJCAI 2017: 793-799 - [i6]Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the Height of Towers of Subsequences and Prefixes. CoRR abs/1705.02813 (2017) - 2016
- [j3]Raphaël Bonaque, Tien Duc Cao, Bogdan Cautis, François Goasdoué, Javier Letelier, Ioana Manolescu, Oscar Mendoza, Swen Ribeiro, Xavier Tannier, Michaël Thomazo:
Mixed-instance querying: a lightweight integration architecture for data journalism. Proc. VLDB Endow. 9(13): 1513-1516 (2016) - [c17]Sebastian Rudolph
Expressivity of Datalog Variants - Completing the Picture. IJCAI 2016: 1230-1236 - [c16]Markus Krötzsch, Tomás Masopust
On the Complexity of Universality for Partially Ordered NFAs. MFCS 2016: 61:1-61:14 - [c15]Meghyn Bienvenu
On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules. RR 2016: 1-17 - [i5]Markus Krötzsch, Tomás Masopust, Michaël Thomazo:
Complexity of Universality and Related Problems for Partially Ordered NFAs. CoRR abs/1609.03460 (2016) - 2015
- [j2]Mélanie König, Michel Leclère
Sound, complete and minimal UCQ-rewriting for existential rules. Semantic Web 6(5): 451-475 (2015) - [c14]Sarah Alice Gaggl, Sebastian Rudolph, Michaël Thomazo:
What Is a Reasonable Argumentation Semantics? Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 309-324 - [c13]Tomás Masopust
On the Complexity of k-Piecewise Testability and the Depth of Automata. DLT 2015: 364-376 - [c12]Sebastian Rudolph
Characterization of the Expressivity of Existential Rule Queries. IJCAI 2015: 3193-3199 - 2014
- [c11]Michaël Thomazo, Sebastian Rudolph
Mixing Materialization and Query Rewriting for Existential Rules. ECAI 2014: 897-902 - [c10]Marie-Laure Mugnier, Michaël Thomazo:
An Introduction to Ontology-Based Query Answering with Existential Rules. Reasoning Web 2014: 245-278 - [i4]Stepan Holub, Tomás Masopust, Michaël Thomazo:
Alternating Towers and Piecewise Testable Separators. CoRR abs/1409.3943 (2014) - [i3]Tomás Masopust, Michaël Thomazo:
On $k$-piecewise testability (preliminary report). CoRR abs/1412.1641 (2014) - [i2]Sebastian Rudolph, Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier:
Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses. CoRR abs/1412.4485 (2014) - 2013
- [b1]Michaël Thomazo:
Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms. Montpellier 2 University, France, 2013 - [c9]Michaël Thomazo:
Compact Rewritings for Existential Rules. IJCAI 2013: 1125-1131 - [c8]Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo:
Sound, Complete, and Minimal Query Rewriting for Existential Rules. IJCAI 2013: 3017-3021 - [c7]Michaël Thomazo:
Ontology Based Query Answering with Existential Rules. IJCAI 2013: 3245-3246 - [c6]Mélanie König, Michel Leclère
On the Exploration of the Query Rewriting Space with Existential Rules. RR 2013: 123-137 - [i1]Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo:
Sound, Complete and Minimal UCQ-Rewriting for Existential Rules. CoRR abs/1311.3198 (2013) - 2012
- [j1]Marie-Laure Mugnier, Geneviève Simonet, Michaël Thomazo:
On the complexity of entailment in existential conjunctive first-order logic with atomic negation. Inf. Comput. 215: 8-31 (2012) - [c5]Michaël Thomazo:
From EL to Tractable Existential Rules with Complex Role Inclusions. Description Logics 2012 - [c4]Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph
A Generic Querying Algorithm for Greedy Sets of Existential Rules. KR 2012 - [c3]Mélanie König, Michel Leclère, Marie-Laure Mugnier, Michaël Thomazo:
A Sound and Complete Backward Chaining Algorithm for Existential Rules. RR 2012: 122-138 - 2011
- [c2]Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph
Walking the Complexity Lines for Generalized Guarded Existential Rules. IJCAI 2011: 712-717 - [c1]Jean-François Baget, Marie-Laure Mugnier, Michaël Thomazo:
Towards Farsighted Dependencies for Existential Rules. RR 2011: 30-45
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: