Mikaël Monet

According to our database, Mikaël Monet authored at least 29 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The Non-Cancelling Intersections Conjecture.

Antoine Amarilli, Mikaël Monet, Dan Suciu

CoRR, 2024

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases.

Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan

CoRR, 2024

Ranked Enumeration for MSO on Trees via Knowledge Compilation.

Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet

Proceedings of the 27th International Conference on Database Theory, 2024

2023

The Shapley Value in Database Management.

Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet

SIGMOD Rec., June, 2023

On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results.

Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet

J. Mach. Learn. Res., 2023

Enumerating Regular Languages with Bounded Delay.

Antoine Amarilli, Mikaël Monet

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Enumerating Regular Languages in Constant Delay.

Antoine Amarilli, Mikaël Monet

CoRR, 2022

Computing the Shapley Value of Facts in Query Answering.

Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values.

Susan B. Davidson, Daniel Deutch, Nave Frost, Benny Kimelfeld, Omer Koren, Mikaël Monet

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.

Antoine Amarilli, Mikaël Monet

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

The Complexity of Counting Problems Over Incomplete Databases.

Marcelo Arenas, Pablo Barceló, Mikaël Monet

ACM Trans. Comput. Log., 2021

The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits.

Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The Expressive Power of Graph Neural Networks as a Query Language.

Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva

SIGMOD Rec., 2020

Correction to: Connecting Knowledge Compilation Classes and Width Parameters.

Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart

Theory Comput. Syst., 2020

Connecting Knowledge Compilation Classes and Width Parameters.

Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart

Theory Comput. Syst., 2020

The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits.

Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet

CoRR, 2020

Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases.

Mikaël Monet

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Counting Problems over Incomplete Databases.

Marcelo Arenas, Pablo Barceló, Mikaël Monet

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Model Interpretability through the lens of Computational Complexity.

Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

The Logical Expressiveness of Graph Neural Networks.

Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Evaluating Datalog via Tree Automata and Cycluits.

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

Theory Comput. Syst., 2019

2018

Combined Complexity of Probabilistic Query Evaluation. (Complexité combinée d'évaluation de requêtes sur des données probabilistes).

Mikaël Monet

PhD thesis, 2018

Connecting Width and Structure in Knowledge Compilation.

Antoine Amarilli, Mikaël Monet, Pierre Senellart

Proceedings of the 21st International Conference on Database Theory, 2018

Towards Deterministic Decomposable Circuits for Safe Queries.

Mikaël Monet, Dan Olteanu

Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, 2018

2017

Conjunctive Queries on Probabilistic Graphs: Combined Complexity.

Antoine Amarilli, Mikaël Monet, Pierre Senellart

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

Combined Tractability of Query Evaluation via Tree Automata and Cycluits.

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

Proceedings of the 20th International Conference on Database Theory, 2017

2016

Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version).

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart

CoRR, 2016

Challenges for Efficient Query Evaluation on Structured Probabilistic Data.

Antoine Amarilli, Silviu Maniu, Mikaël Monet

Proceedings of the Scalable Uncertainty Management - 10th International Conference, 2016

Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances.

Mikaël Monet

Proceedings of the SIGMOD 2016 PhD Symposium, 2016