Understanding the complexity of #SAT using knowledge compilation.

Florent Capelli

Published in: LICS (2017)

Keyphrases

knowledge compilation
model counting
product configuration
polynomial size
prime implicates
normal form
satisfiability problem
cnf formula
quantified boolean formulae
computational complexity
worst case
space complexity
logical inference
search algorithm
target language
sat problem