Proof Complexity of Propositional Model Counting

Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann. Proof Complexity of Propositional Model Counting. In Meena Mahajan, Friedrich Slivovsky, editors, 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy. Volume 271 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Abstract

Abstract is missing.