Florent Capelli

According to our database, Florent Capelli authored at least 29 papers between 2013 and 2024.

Collaborative distances:

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

2024

Linear Programs with Conjunctive Database Queries.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

Log. Methods Comput. Sci., 2024

Direct Access for Conjunctive Queries with Negations.

Florent Capelli, Oliver Irwin

Proceedings of the 27th International Conference on Database Theory, 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

A Knowledge Compilation Take on Binary Polynomial Optimization.

Florent Capelli, Alberto Del Pia, Silvia Di Gregorio

CoRR, 2023

Direct Access for Conjunctive Queries with Negation.

Florent Capelli, Oliver Irwin

CoRR, 2023

Geometric Amortization of Enumeration Algorithms.

Florent Capelli, Yann Strozecki

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

2022

Linear Programs with Conjunctive Queries.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

Proceedings of the 25th International Conference on Database Theory, 2022

2021

Enumerating models of DNF faster: Breaking the dependency on the formula size.

Florent Capelli, Yann Strozecki

Discret. Appl. Math., 2021

Certifying Top-Down Decision-DNNF Compilers.

Florent Capelli, Jean-Marie Lagniez, Pierre Marquis

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

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

2019

Counting minimal transversals of <i>β</i>-acyclic hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

J. Comput. Syst. Sci., 2019

Incremental delay enumeration: Space and time.

Florent Capelli, Yann Strozecki

Discret. Appl. Math., 2019

Dependency Weighted Aggregation on Factorized Databases.

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon

CoRR, 2019

Tractable QBF by Knowledge Compilation.

Florent Capelli, Stefan Mengel

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Knowledge Compilation Languages as Proof Systems.

Florent Capelli

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018

Counting Minimal Transversals of β-Acyclic Hypergraphs.

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

CoRR, 2018

Knowledge Compilation, Width and Quantification.

Florent Capelli, Stefan Mengel

CoRR, 2018

2017

Non-FPT lower bounds for structural restrictions of decision DNNF.

Andrea Calì, Florent Capelli, Igor Razgon

CoRR, 2017

On The Complexity of Enumeration.

Florent Capelli, Yann Strozecki

CoRR, 2017

Understanding the complexity of #SAT using knowledge compilation.

Florent Capelli

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

The Arithmetic Complexity of Tensor Contraction.

Florent Capelli, Arnaud Durand, Stefan Mengel

Theory Comput. Syst., 2016

Knowledge Compilation Meets Communication Complexity.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Understanding Model Counting for beta-acyclic CNF-formulas.

Johann Brault-Baron, Florent Capelli, Stefan Mengel

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Compiling CNFs into Structured Deterministic DNNFs.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

2014

Understanding model counting for $β$-acyclic CNF-formulas.

Johann Brault-Baron, Florent Capelli, Stefan Mengel

CoRR, 2014

Expander CNFs have Exponential DNNF Size.

Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky

CoRR, 2014

Hypergraph Acyclicity and Propositional Model Counting.

Florent Capelli, Arnaud Durand, Stefan Mengel

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

The arithmetic complexity of tensor contractions.

Florent Capelli, Arnaud Durand, Stefan Mengel

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013