Proof Complexity of Propositional Model Counting.
Olaf BeyersdorffTim HoffmannLuc Nicolas SpachmannPublished in: Electron. Colloquium Comput. Complex. (2024)
Keyphrases
- model counting
- polynomial size
- satisfiability testing
- weighted model counting
- knowledge compilation
- propositional formulas
- worst case
- propositional logic
- natural language processing
- expert systems
- probabilistic inference
- computational complexity
- theorem proving
- boolean functions
- dnf formulas
- first order logic
- orders of magnitude
- knowledge representation