Understanding the complexity of #SAT using knowledge compilation.
Florent CapelliPublished in: CoRR (2017)
Keyphrases
- knowledge compilation
- model counting
- product configuration
- polynomial size
- prime implicates
- computational complexity
- logical inference
- decision problems
- normal form
- phase transition
- sat problem
- cnf formula
- machine learning
- propositional satisfiability
- binary decision diagrams
- propositional formulas
- quantified boolean formulae
- search algorithm