Florent Capelli

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 32

Top Topics

Conjunctive Queries

Knowledge Compilation

Prime Implicates

Top Venues

Theory Comput. Syst.

Publications

Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Database Queries. Log. Methods Comput. Sci. 20 (1) (2024)
Antoine Amarilli, Florent Capelli
Tractable Circuits in Database Theory. SIGMOD Rec. 53 (2) (2024)
Antoine Amarilli, Florent Capelli
Tractable Circuits in Database Theory. CoRR (2024)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. ICDT (2024)
Florent Capelli, Oliver Irwin
Direct Access for Conjunctive Queries with Negations. ICDT (2024)
Florent Capelli, Yann Strozecki
Geometric Amortization of Enumeration Algorithms. STACS (2023)
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
Ranked Enumeration for MSO on Trees via Knowledge Compilation. CoRR (2023)
Florent Capelli, Alberto Del Pia, Silvia Di Gregorio
A Knowledge Compilation Take on Binary Polynomial Optimization. CoRR (2023)
Florent Capelli, Oliver Irwin
Direct Access for Conjunctive Queries with Negation. CoRR (2023)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Queries. ICDT (2022)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Linear Programs with Conjunctive Database Queries. CoRR (2022)
Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: Breaking the dependency on the formula size. Discret. Appl. Math. 303 (2021)
Florent Capelli, Jean-Marie Lagniez, Pierre Marquis
Certifying Top-Down Decision-DNNF Compilers. AAAI (2021)
Florent Capelli, Yann Strozecki
Geometric Amortization of Enumeration Algorithms. CoRR (2021)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. Theory Comput. Syst. 64 (5) (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)
Florent Capelli
Knowledge Compilation Languages as Proof Systems. SAT (2019)
Florent Capelli
Knowledge compilation languages as proof systems. CoRR (2019)
Florent Capelli, Stefan Mengel
Tractable QBF by Knowledge Compilation. STACS (2019)
Florent Capelli, Yann Strozecki
Incremental delay enumeration: Space and time. Discret. Appl. Math. 268 (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
-acyclic hypergraphs. J. Comput. Syst. Sci. 101 (2019)
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
Dependency Weighted Aggregation on Factorized Databases. CoRR (2019)
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR (2018)
Florent Capelli, Yann Strozecki
Enumerating models of DNF faster: breaking the dependency on the formula size. CoRR (2018)
Florent Capelli, Stefan Mengel
Knowledge Compilation, Width and Quantification. CoRR (2018)
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
Connecting Knowledge Compilation Classes and Width Parameters. CoRR (2018)
Florent Capelli, Yann Strozecki
On The Complexity of Enumeration. CoRR (2017)
Florent Capelli
Understanding the complexity of #SAT using knowledge compilation. LICS (2017)
Andrea Calì, Florent Capelli, Igor Razgon
Non-FPT lower bounds for structural restrictions of decision DNNF. CoRR (2017)
Florent Capelli
Understanding the complexity of #SAT using knowledge compilation. CoRR (2017)
Florent Capelli, Arnaud Durand, Stefan Mengel
The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. 58 (4) (2016)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Knowledge Compilation Meets Communication Complexity. IJCAI (2016)
Johann Brault-Baron, Florent Capelli, Stefan Mengel
Understanding Model Counting for beta-acyclic CNF-formulas. STACS (2015)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
On Compiling CNFs into Structured Deterministic DNNFs. SAT (2015)
Florent Capelli, Arnaud Durand, Stefan Mengel
Hypergraph Acyclicity and Propositional Model Counting. SAT (2014)
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
Expander CNFs have Exponential DNNF Size. CoRR (2014)
Johann Brault-Baron, Florent Capelli, Stefan Mengel
Understanding model counting for $β$-acyclic CNF-formulas. CoRR (2014)
Florent Capelli, Arnaud Durand, Stefan Mengel
Hypergraph Acyclicity and Propositional Model Counting. CoRR (2014)
Florent Capelli, Arnaud Durand, Stefan Mengel
The arithmetic complexity of tensor contractions. STACS (2013)
Florent Capelli, Arnaud Durand, Stefan Mengel
The arithmetic complexity of tensor contractions CoRR (2012)