Hypergraph Acyclicity and Propositional Model Counting.
Florent CapelliArnaud DurandStefan MengelPublished in: SAT (2014)
Keyphrases
- model counting
- satisfiability testing
- weighted model counting
- knowledge compilation
- bounded treewidth
- polynomial size
- propositional logic
- propositional formulas
- data exchange
- np hard
- learning theory
- bayesian networks
- query answering
- constraint satisfaction problems
- np complete
- knowledge based systems
- search algorithm