Proof Complexity of Propositional Model Counting.

Olaf Beyersdorff Tim Hoffmann Luc Nicolas Spachmann

Published in: SAT (2023)

Keyphrases

model counting
polynomial size
satisfiability testing
knowledge compilation
propositional formulas
weighted model counting
propositional logic
first order logic
boolean functions
decision problems
space complexity
learning algorithm
knowledge base
theorem prover
theorem proving
multi valued