Login / Signup
Model Counting for Formulas of Bounded Clique-Width.
Friedrich Slivovsky
Stefan Szeider
Published in:
CoRR (2014)
Keyphrases
</>
model counting
propositional formulas
polynomial size
weighted model counting
knowledge compilation
propositional logic
normal form
bounded treewidth
satisfiability testing
cnf formula
sat problem
objective function
np complete
boolean functions