Model Counting for CNF Formulas of Bounded Modular Treewidth.
Daniël PaulusmaFriedrich SlivovskyStefan SzeiderPublished in: STACS (2013)
Keyphrases
- model counting
- bounded treewidth
- cnf formula
- np complete
- polynomial size
- propositional formulas
- knowledge compilation
- np hard
- computational complexity
- satisfiability problem
- randomly generated
- boolean functions
- constraint satisfaction problems
- conjunctive queries
- phase transition
- sat problem
- max sat
- constraint programming
- upper bound
- evolutionary algorithm
- search space