Publications
Accepted, under review.
Journal articles
-
Marcelo Arenas,
Pablo Barceló,
Leopoldo Bertossi,
Mikaël Monet.
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results.
[pdf on arXiv], [conference version] -
Marcelo Arenas,
Pablo Barceló,
Mikaël Monet.
The Complexity of Counting Problems over Incomplete Databases.
TOCL 2021. [pdf on arXiv], [conference version] -
Antoine Amarilli,
Florent Capelli,
Mikaël Monet,
Pierre Senellart.
Connecting Knowledge Compilation Classes and Width Parameters.
ToCS 2020. [pdf on arXiv], [conference version] -
Antoine Amarilli,
Pierre Bourhis,
Mikaël Monet,
Pierre Senellart.
Evaluating Datalog via Tree Automata and Cycluits.
ToCS 2019. [pdf on arXiv], [conference version]
Conference articles
-
Marcelo Arenas,
Pablo Barceló,
Leopoldo Bertossi,
Mikaël Monet.
The Tractability of SHAP-Score-Based Explanations over Deterministic and Decomposable Boolean Circuits.
AAAI 2020. [pdf on arXiv], [journal version] -
Pablo Barceló,
Mikaël Monet,
Jorge Pérez,
Bernardo Subercaseaux.
Model Interpretability through the Lens of Computational Complexity.
NeurIPS 2020. [pdf on arXiv] -
Marcelo Arenas,
Pablo Barceló,
Mikaël Monet.
Counting Problems over Incomplete Databases.
PODS 2020. [pdf on arXiv], [journal version] -
Pablo Barceló,
Egor Kostylev,
Mikaël Monet, Jorge Pérez,
Juan Reutter,
Juan-Pablo Silva.
The Logical Expressiveness of Graph Neural Networks.
ICLR 2020. [pdf on OpenReview], [workshop version] -
Mikaël Monet.
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases.
PODS 2020. [pdf on arXiv] -
Antoine Amarilli,
Mikaël Monet,
Pierre Senellart.
Connecting Width and Structure in Knowledge Compilation.
ICDT 2018. [pdf on arXiv], [journal version] -
Antoine Amarilli,
Mikaël Monet,
Pierre Senellart.
Conjunctive Queries on Probabilistic Graphs: Combined Complexity.
PODS 2017. [pdf on arXiv] -
Antoine Amarilli,
Pierre Bourhis,
Mikaël Monet,
Pierre Senellart.
Combined Tractability of Query Evaluation via Tree Automata and Cycluits.
ICDT 2017. [pdf on arXiv], [journal version] -
Antoine Amarilli,
Silviu Maniu,
Mikaël Monet.
Challenges for Efficient Query Evaluation on Structured Probabilistic Data.
SUM 2016. [pdf on arXiv]
Workshop articles
-
Pablo Barceló,
Egor Kostylev,
Mikaël Monet, Jorge Pérez,
Juan Reutter,
Juan-Pablo Silva.
Logical Expressiveness of Graph Neural Networks.
GRL 2019. [pdf], [conference version] -
Mikaël Monet,
Dan Olteanu.
Towards Deterministic Decomposable Circuits for Safe Queries.
AMW 2018. [pdf on arXiv]. [code only]. [code + functions] -
Mikaël Monet.
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances.
SIGMOD/PODS 2016 PhD Symposium. [pdf]