Model Counting for CNF Formulas of Bounded Modular Treewidth.
Daniël PaulusmaFriedrich SlivovskyStefan SzeiderPublished in: Algorithmica (2016)
Keyphrases
- model counting
- bounded treewidth
- cnf formula
- np complete
- polynomial size
- knowledge compilation
- propositional formulas
- np hard
- satisfiability problem
- constraint satisfaction problems
- randomly generated
- conjunctive queries
- computational complexity
- phase transition
- sat problem
- normal form
- max sat
- decision problems
- special case
- space complexity
- linear programming
- natural language processing
- expert systems
- search algorithm