Model Counting for Formulas of Bounded Clique-Width.

Friedrich Slivovsky Stefan Szeider

Published in: ISAAC (2013)

Keyphrases

model counting
propositional formulas
weighted model counting
polynomial size
propositional logic
knowledge compilation
bounded treewidth
normal form
satisfiability testing
probabilistic inference
database systems
propositional satisfiability