Andreas Goral — accepted AI-conference papers

2026

Proof Systems for Tensor-based Model Counting

Olaf Beyersdorff, Joachim Giesen, Andreas Goral, Tim Hoffmann, Kaspar Kasche, Christoph Staudt

AAAI 2026technical

Solving the model counting problem #SAT, asking for the number of satisfying assignments of a propositional formula, has been explored intensively and has gathered its own community. While most existing solvers are based on knowledge compilation, another promising approach is through contraction in

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

Model Counting and Sampling via Semiring Extensions

Andreas Goral, Joachim Giesen, Mark Blacher, Christoph Staudt, Julien Klaus

AAAI 2024technical

Many decision and optimization problems have natural extensions as counting problems. The best known example is the Boolean satisfiability problem (SAT), where we want to count the satisfying assignments of truth values to the variables, which is known as the #SAT problem. Likewise, for discrete opt…

Cited by 2 Source ↗PDF ↗Scholar ↗