I hold a Maître de Conférences position (which roughly corresponds to associate professor) in [Université de Lille](https://www.univ-lille.fr). I teach at the [applied language departement](https://www.univ-lille3.fr/ufr-lea/) and I am a member of Inria's team [LINKS](https://team.inria.fr/links/). I am mostly interested in aggregations problems in databases and artificial intelligence and knowledge compilation.
# Contact
* Mail : florent.capelli (at) univ-lille (dot) fr ([GPG key](key.asc))
* Parc Scientifique de la Haute Borne,
Park Plaza - INRIA Bât B - avenue Halley
59650 Villeneuve d'Ascq
* Bureau B214
# Publications
## Journal
* [The Arithmetic Complexity of Tensor Contraction](http://dx.doi.org/10.1007/s00224-015-9630-8), with A. Durand et S. Mengel, _Theory of Computing Systems, STACS Special Issue_, 2015
## Conferences
* [Understanding the complexity of #SAT using knowledge compilation](https://arxiv.org/abs/1701.01461), _Symposium on Logic in Computer Science (LICS 17)_, 2017.
* [Knowledge Compilation Meets Communication Complexity](publi/kc_meets_cc.pdf), with S. Bova, S. Mengel, F. Slivovsky, _International Joint Conference on Artificial Intelligence (IJCAI 16)_, 2016.
* [On Compiling CNFs into Structured Deterministic DNNF](publi/cnf-to-ddnnf-upper-bound.pdf), with S. Bova, S. Mengel, F. Slivovsky, _Theory and Applications of Satisfiability Testing (SAT 2015)_, 2015
* [Understanding Model Counting for β-acyclic CNF-formulas](http://arxiv.org/abs/1405.6043), with J. Brault-Baron, S. Mengel, _32th Symposium on Theoretical Aspects of Computer Science (STACS 2015)_, 2015
* [Hypergraph Acyclicity and Propositional Model Counting](http://arxiv.org/abs/1401.6307), with A. Durand, S. Mengel, _Theory and Applications of Satisfiability Testing (SAT 2014)_, 2014
* [The Complexity of Tensor Contraction](publi/Capelli-Durand-Mengel-Tensor_Contraction.pdf), with A. Durand, S. Mengel, _30th Symposium on Theoretical Aspects of Computer Science (STACS 2013)_, 2013
## Preprints
* [Knowledge Compilation, Width and Quantification](https://arxiv.org/abs/1807.04263), with Stefan Mengel
* [Non-FPT lower bounds for structural restrictions of decision DNNF](https://arxiv.org/abs/1708.07767), with Andrea Calì, Igor Razgon
* [On the complexity of enumeration](https://arxiv.org/abs/1703.01928), with Y. Strozecki
* [A Strongly Exponential Separation of DNNFs from CNF Formulas](https://arxiv.org/abs/1411.1995), with S. Bova, S. Mengel, F. Slivovsky
(preliminary version of the paper "Knowledge Compilation Meets Communication Complexity", IJCAI 16)
## Manuscripts
* [Structural restriction of CNF-formulas: application to model counting and knowledge compilation](publi/these_capelli.pdf), Florent Capelli. PhD Thesis, 2016.
## Posters
* [Compilation des formules CNF](publi/poster.pdf), Journées Nationales du GDR IM 2016 (in French).
# [[+]](#communication) Talks
* **Séminaire ALGO du GREYC**, *Bornes inférieures pour les branching programs*, Caen, 21/03/2017
* **Séminaire de l'équipe ACRO**, *Lower bounds for branching programs*, Marseille, 12/12/2016
* **Séminaire de l'équipe LIRICA**, *Structural restrictions of CNF-formulas: applications and limitations*, Marseille, 12/12/2016
* **Séminaire de l'équipe LINKS**, *Structural restrictions of CNF-formulas: applications and limitations*, Lille, 18/11/2016
* **Séminaire Dagstuhl, SAT and Interaction**, *Compilation of CNF-formulas: upper and lower bounds*, Dagstuhl, 18/09/2016
* **Journées de l'ANR AGGREG**, *Some results on complexity classes for enumeration*, Marseille, 11/07/2016
* **International Workshop on Graph Structure and Satisfiability Testing**, *Structure-based knowledge compilation: the singular case of beta-acyclic formulas*, Bordeaux, 04/07/2016
* **Groupe de travail LAAG**, *Une présentation du théorème de Lyndon*, Paris, 16/06/2016
* **Journées du GT ALGA**, *Knowledge Compilation and Communication Complexity*, Marseille, 12/04/2016
* **Theory reading group, KTH**, *Structural restrictions of CNF-formulas: applications and limitations.*, Stockholm, 16/03/2016
* **Séminaire Automate, LIAFA**, *Structural restrictions of CNF-formulas: applications and limitations.*, Paris, 11/03/2016
* **JGA 2015**, *Borne inférieure de circuits : une application des expanders*, Orléans, 06/11/2015
* **Journée de l'ANR AGGREG**, *#SAT and hypergraph acyclicity*, Paris, 06/07/2015
* **STACS 2015**, *Understanding model counting for beta-acyclic formulas*, München, 06/03/2015
* **Séminaire du GREYC**, *#SAT et acyclicté d'hypergraphe*, Caen, 20/01/2015
* **Journée de l'ANR CompA**, *Compilation de CNF vers les circuits booléens : une borne inférieure*, Paris, 15/01/2015
* **Séminaire de l'équipe MAGMAT**, *#SAT et acyclicité d'hypergraphe*, Versailles, 17/10/2014
* **Séminaire du CRIL**, *Complexité paramétrée de #SAT*, Lens, 16/10/2014
* **Bourbakettes**, *Complexité paramétrée*, Paris, 23/09/2014
* **Highlights 2014**, *Hypergraph Acyclicities and Propositional Model Counting*, 05/09/2014
* **SAT 2014**, *Hypergraph Acyclicity and Propositional Model Counting*, Vienne, 17/07/2014
* **EJCIM 2014**, *Acyclicité d'hypergraphe et #SAT*, Caen, 03/04/2014
* **Journées CompA**, *The arithmetic complexity of tensor contractions*, Lyon, 04/03/2014
* **STACS 2013**, *The arithmetic complexity of tensor contractions*, Kiel, 02/2013
* **Groupe de travail MC2**, *The arithmetic complexity of tensor contractions*, Lyon, 10/10/2012
# Teaching
* I have organised a research school at ENS Lyon on Knowledge
Compilation. See [here](research_school.html) for more details.
* For teaching material, see the [French version](index.html) of this webpage.