Florent Capelli

47 papers A* 4A 13Journal 30
YearRankTypeTitle / Venue / Authors
2026 A conf
Building Relational Circuits (Invited Talk).
ICDT
Florent Capelli
2026 J jnl
Direct Access for Conjunctive Queries with Negations.
Log. Methods Comput. Sci.
Florent Capelli, Nofar Carmeli, Oliver Irwin, Sylvain Salvati
2025 A conf
A Simple Algorithm for Worst Case Optimal Join and Sampling.
ICDT
Florent Capelli, Oliver Irwin, Sylvain Salvati
2025 A conf
Dynamic Direct Access of MSO Query Evaluation over Strings.
ICDT
Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros
2024 J jnl
A Simple Algorithm for Worst-Case Optimal Join and Sampling.
CoRR
Florent Capelli, Oliver Irwin, Sylvain Salvati
2024 A* conf
A Top-Down Tree Model Counter for Quantified Boolean Formulas.
IJCAI
Florent Capelli, Jean-Marie Lagniez, Andreas Plank, Martina Seidl
2024 A conf
Direct Access for Conjunctive Queries with Negations.
ICDT
Florent Capelli, Oliver Irwin
2024 J jnl
Dynamic direct access of MSO query evaluation over strings.
CoRR
Pierre Bourhis, Florent Capelli, Stefan Mengel, Cristian Riveros
2024 J jnl
Linear Programs with Conjunctive Database Queries.
Log. Methods Comput. Sci.
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2024 A conf
Ranked Enumeration for MSO on Trees via Knowledge Compilation.
ICDT
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2024 J jnl
Tractable Circuits in Database Theory.
CoRR
Antoine Amarilli, Florent Capelli
2024 J jnl
Tractable Circuits in Database Theory.
SIGMOD Rec.
Antoine Amarilli, Florent Capelli
2023 J jnl
A Knowledge Compilation Take on Binary Polynomial Optimization.
CoRR
Florent Capelli, Alberto Del Pia, Silvia Di Gregorio
2023 J jnl
Direct Access for Conjunctive Queries with Negation.
CoRR
Florent Capelli, Oliver Irwin
2023 A conf
Geometric Amortization of Enumeration Algorithms.
STACS
Florent Capelli, Yann Strozecki
2023 J jnl
Ranked Enumeration for MSO on Trees via Knowledge Compilation.
CoRR
Antoine Amarilli, Pierre Bourhis, Florent Capelli, Mikaël Monet
2022 J jnl
Linear Programs with Conjunctive Database Queries.
CoRR
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2022 A conf
Linear Programs with Conjunctive Queries.
ICDT
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2021 A* conf
Certifying Top-Down Decision-DNNF Compilers.
AAAI
Florent Capelli, Jean-Marie Lagniez, Pierre Marquis
2021 J jnl
Enumerating models of DNF faster: Breaking the dependency on the formula size.
Discret. Appl. Math.
Florent Capelli, Yann Strozecki
2021 J jnl
Geometric Amortization of Enumeration Algorithms.
CoRR
Florent Capelli, Yann Strozecki
2020 J jnl
Connecting Knowledge Compilation Classes and Width Parameters.
Theory Comput. Syst.
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2020 J jnl
Correction to: Connecting Knowledge Compilation Classes and Width Parameters.
Theory Comput. Syst.
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2019 J jnl
Counting minimal transversals of
J. Comput. Syst. Sci.
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2019 J jnl
Dependency Weighted Aggregation on Factorized Databases.
CoRR
Florent Capelli, Nicolas Crosetti, Joachim Niehren, Jan Ramon
2019 J jnl
Incremental delay enumeration: Space and time.
Discret. Appl. Math.
Florent Capelli, Yann Strozecki
2019 A conf
Knowledge Compilation Languages as Proof Systems.
SAT
Florent Capelli
2019 J jnl
Knowledge compilation languages as proof systems.
CoRR
Florent Capelli
2019 A conf
Tractable QBF by Knowledge Compilation.
STACS
Florent Capelli, Stefan Mengel
2018 J jnl
Connecting Knowledge Compilation Classes and Width Parameters.
CoRR
Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart
2018 J jnl
Counting Minimal Transversals of β-Acyclic Hypergraphs.
CoRR
Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté
2018 J jnl
Enumerating models of DNF faster: breaking the dependency on the formula size.
CoRR
Florent Capelli, Yann Strozecki
2018 J jnl
Knowledge Compilation, Width and Quantification.
CoRR
Florent Capelli, Stefan Mengel
2017 J jnl
Non-FPT lower bounds for structural restrictions of decision DNNF.
CoRR
Andrea Calì, Florent Capelli, Igor Razgon
2017 J jnl
On The Complexity of Enumeration.
CoRR
Florent Capelli, Yann Strozecki
2017 A* conf
Understanding the complexity of #SAT using knowledge compilation.
LICS
Florent Capelli
2017 J jnl
Understanding the complexity of #SAT using knowledge compilation.
CoRR
Florent Capelli
2016 A* conf
Knowledge Compilation Meets Communication Complexity.
IJCAI
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2016 J jnl
The Arithmetic Complexity of Tensor Contraction.
Theory Comput. Syst.
Florent Capelli, Arnaud Durand, Stefan Mengel
2015 A conf
On Compiling CNFs into Structured Deterministic DNNFs.
SAT
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2015 A conf
Understanding Model Counting for beta-acyclic CNF-formulas.
STACS
Johann Brault-Baron, Florent Capelli, Stefan Mengel
2014 J jnl
Expander CNFs have Exponential DNNF Size.
CoRR
Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky
2014 A conf
Hypergraph Acyclicity and Propositional Model Counting.
SAT
Florent Capelli, Arnaud Durand, Stefan Mengel
2014 J jnl
Hypergraph Acyclicity and Propositional Model Counting.
CoRR
Florent Capelli, Arnaud Durand, Stefan Mengel
2014 J jnl
Understanding model counting for $β$-acyclic CNF-formulas.
CoRR
Johann Brault-Baron, Florent Capelli, Stefan Mengel
2013 A conf
The arithmetic complexity of tensor contractions.
STACS
Florent Capelli, Arnaud Durand, Stefan Mengel
2012 J jnl
The arithmetic complexity of tensor contractions
CoRR
Florent Capelli, Arnaud Durand, Stefan Mengel