Mikaël Monet

ORCID

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 45

Top Venues

University of Paris-Saclay, France (PHD)

Education History

University of Paris-Saclay, France

PHD

Publications

Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan
Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases. CoRR (2024)
Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet
The Shapley Value in Database Management. CoRR (2024)
Antoine Amarilli, Marcelo Arenas, YooJung Choi, Mikaël Monet, Guy Van den Broeck, Benjie Wang
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata. CoRR (2024)
Pratik Karmakar, Mikaël Monet, Pierre Senellart, Stéphane Bressan
Expected Shapley-Like Scores of Boolean functions: Complexity and Applications to Probabilistic Databases. Proc. ACM Manag. Data 2 (2) (2024)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT (2024)
Antoine Amarilli, Mikaël Monet, Dan Suciu
The Non-Cancelling Intersections Conjecture. CoRR (2024)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. J. Mach. Learn. Res. 24 (2023)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR (2023)
Antoine Amarilli, Mikaël Monet
Enumerating Regular Languages with Bounded Delay. STACS (2023)
Leopoldo E. Bertossi, Benny Kimelfeld, Ester Livshits, Mikaël Monet
The Shapley Value in Database Management. SIGMOD Rec. 52 (2) (2023)
Antoine Amarilli, Mikaël Monet
Enumerating Regular Languages in Constant Delay. CoRR (2022)
Susan B. Davidson, Daniel Deutch, Nave Frost, Benny Kimelfeld, Omer Koren, Mikaël Monet
ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values. SIGMOD Conference (2022)
Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet
Computing the Shapley Value of Facts in Query Answering. SIGMOD Conference (2022)
Antoine Amarilli, Mikaël Monet
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. CoRR (2022)
Antoine Amarilli, Mikaël Monet
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. MFCS (2022)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
The Complexity of Counting Problems Over Incomplete Databases. ACM Trans. Comput. Log. 22 (4) (2021)
Daniel Deutch, Nave Frost, Benny Kimelfeld, Mikaël Monet
Computing the Shapley Value of Facts in Query Answering. CoRR (2021)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits. AAAI (2021)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. CoRR (2021)
Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
The Logical Expressiveness of Graph Neural Networks. ICLR (2020)
Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet
The Tractability of SHAP-scores over Deterministic and Decomposable Boolean Circuits. CoRR (2020)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
The Complexity of Counting Problems over Incomplete Databases. CoRR (2020)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64 (5) (2020)
Pablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez, Juan L. Reutter, Juan Pablo Silva
The Expressive Power of Graph Neural Networks as a Query Language. SIGMOD Rec. 49 (2) (2020)
Mikaël Monet
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. PODS (2020)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
Counting Problems over Incomplete Databases. PODS (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the lens of Computational Complexity. NeurIPS (2020)
Pablo Barceló, Mikaël Monet, Jorge Pérez, Bernardo Subercaseaux
Model Interpretability through the Lens of Computational Complexity. CoRR (2020)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Correction to: Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64 (5) (2020)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. Theory Comput. Syst. 63 (7) (2019)
Marcelo Arenas, Pablo Barceló, Mikaël Monet
Counting Problems over Incomplete Databases. CoRR (2019)
Mikaël Monet, Dan Olteanu
Towards Deterministic Decomposable Circuits for Safe Queries. CoRR (2019)
Mikaël Monet
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. CoRR (2019)
Mikaël Monet, Dan Olteanu
Towards Deterministic Decomposable Circuits for Safe Queries. AMW (2018)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Connecting Width and Structure in Knowledge Compilation. ICDT (2018)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Evaluating Datalog via Tree Automata and Cycluits. CoRR (2018)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. CoRR (2018)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits. ICDT (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. PODS (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Connecting Width and Structure in Knowledge Compilation. CoRR (2017)
Antoine Amarilli, Mikaël Monet, Pierre Senellart
Conjunctive Queries on Probabilistic Graphs: Combined Complexity. CoRR (2017)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet, Pierre Senellart
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version). CoRR (2016)
Antoine Amarilli, Silviu Maniu, Mikaël Monet
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. SUM (2016)
Mikaël Monet
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. SIGMOD PhD Symposium (2016)
Antoine Amarilli, Silviu Maniu, Mikaël Monet
Challenges for Efficient Query Evaluation on Structured Probabilistic Data. CoRR (2016)

Mikaël Monet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikaël Monet