Alexis de Colnet

About me

I am a post-doc researcher at TU Wien, in the algorithm and complexity group, since November 2022. I did my PhD from September 2019 to November 2022 at CRIL, Université d’Artois, under the supervision of Pierre Marquis and Stefan Mengel.

My thesis is available here.

Research interests.

My main research interests focus on knowledge compilation, proof systems and model counting. Knowledge compilation is the study of representations for functions and of algorithms to transform from one representation to another. I have a particular interest in understanding the practical limitations of knowledge compilers compared to the theory.

Research project

I am the principal investigator of the FWF ESPRIT project “Overcoming Intractability in the Knowledge Compilation Map” (FWF ESP 235).

Publication

My DBLP entry.

2025

  1. An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
    Kuldeep S. Meel, and Alexis Colnet
    In À paraître dans the 28th International Conference on Database Theory (ICDT 2025), 2025

2024

  1. Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
    Leroy Chew, Alexis Colnet, Friedrich Slivovsky, and 1 more author
    In Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, 2024
  2. Compilation and Fast Model Counting beyond CNF
    Alexis Colnet, Stefan Szeider, and Tianwei Zhang
    In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024, Jeju, South Korea, August 3-9, 2024, 2024
  3. On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF
    Alexis Colnet
    In 27th International Conference on Theory and Applications of Satisfiability Testing, SAT 2024, August 21-24, 2024, Pune, India, 2024

2023

  1. Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
    Alexis Colnet, and Stefan Mengel
    J. Artif. Intell. Res., 2023
  2. On Translations between ML Models for XAI Purposes
    Alexis Colnet, and Pierre Marquis
    In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, 2023
  3. Separating Incremental and Non-Incremental Bottom-Up Compilation
    Alexis Colnet
    In 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy, 2023

2022

  1. Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
    Alexis Colnet, and Stefan Mengel
    In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, 2022
  2. On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits
    Alexis Colnet, and Pierre Marquis
    In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, 2022

2021

  1. A Compilation of Succinctness Results for Arithmetic Circuits
    Alexis Colnet, and Stefan Mengel
    In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021, 2021
  2. Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
    Alexis Colnet, and Stefan Mengel
    In Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, 2021

2020

  1. Lower Bounds for Approximate Knowledge Compilation
    Alexis Colnet, and Stefan Mengel
    In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, 2020
  2. A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
    Alexis Colnet
    In Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings, 2020

2019

  1. Dual Hashing-Based Algorithms for Discrete Integration
    Alexis Colnet, and Kuldeep S. Meel
    In Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, 2019