Picture for Florent Capelli

Florent Capelli

Knowledge compilation languages as proof systems

Add code
Mar 10, 2019
Figure 1 for Knowledge compilation languages as proof systems
Viaarxiv icon

Non-FPT lower bounds for structural restrictions of decision DNNF

Add code
Aug 25, 2017
Figure 1 for Non-FPT lower bounds for structural restrictions of decision DNNF
Figure 2 for Non-FPT lower bounds for structural restrictions of decision DNNF
Figure 3 for Non-FPT lower bounds for structural restrictions of decision DNNF
Figure 4 for Non-FPT lower bounds for structural restrictions of decision DNNF
Viaarxiv icon

Understanding the complexity of #SAT using knowledge compilation

Add code
Jan 05, 2017
Figure 1 for Understanding the complexity of #SAT using knowledge compilation
Figure 2 for Understanding the complexity of #SAT using knowledge compilation
Figure 3 for Understanding the complexity of #SAT using knowledge compilation
Viaarxiv icon

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

Add code
May 23, 2014
Figure 1 for Understanding model counting for $β$-acyclic CNF-formulas
Figure 2 for Understanding model counting for $β$-acyclic CNF-formulas
Viaarxiv icon

Hypergraph Acyclicity and Propositional Model Counting

Add code
Jan 24, 2014
Figure 1 for Hypergraph Acyclicity and Propositional Model Counting
Figure 2 for Hypergraph Acyclicity and Propositional Model Counting
Figure 3 for Hypergraph Acyclicity and Propositional Model Counting
Viaarxiv icon