• HDR Defended on :
  • Dec 8, 2021 • salle des thèses, Faculté des sciences Jean Perrin


Counting complexity and knowledge compilation are two closely related research areas. While the first has been studied in many subfields of computer science for several decades, the second is relatively young and was until recently confined to artificial intelligence, its original field. In this habilitation thesis, I review my work on knowledge counting and compilation over the past eight years. In particular, I discuss how structural restrictions on inputs lead to efficient knowledge counting and compilation in several domains and present techniques for showing lower bounds for knowledge compilation. Finally, special emphasis is placed on applications of knowledge compilation in various fields, including artificial intelligence, database theory, and theoretical computer science


  • Pierre Marquis (Supervisor), University of Artois, France
  • Adnan Darwiche (Rapporteur), UCLA, USA
  • Reinhard Pichler (Rapporteur), TU Wien, Austria
  • Pierre Senellart (Rapporteur), École normale supérieure, France
  • Nadia Creignou (Reviewer), Aix Marseille University, France
  • Hélène Fargier (Reviewer), CNRS, France