Model Counting and Sampling via Semiring Extensions

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 optimization problems, we want to count the states on which the objective function attains the optimal value. Both SAT and discrete optimization can be formulated as selective marginalize a product function (MPF) queries. Here, we show how general selective MPF queries can be extended for model counting. MPF queries are encoded as tensor hypernetworks over suitable semirings that can be solved by generic tensor hypernetwork contraction algorithms. Our model counting extension is again an MPF query, on an extended semiring, that can be solved by the same contraction algorithms. Model counting is required for uniform model sampling. We show how the counting extension can be further extended for model sampling by constructing yet another semiring. We have implemented the model counting and sampling extensions. Experiments show that our generic approach is competitive with the state of the art in model counting and model sampling.

Authors

• Andreas Goral Friedrich Schiller University Jena
• Joachim Giesen Friedrich-Schiller Universität Jena
• Mark Blacher Friedrich Schiller University Jena
• Christoph Staudt Friedrich Schiller University Jena
• Julien Klaus Friedrich Schiller University Jena

Keywords

• CSO: Satisfiability
• RU: Graphical Models
• RU: Probabilistic Inference
• SO: Combinatorial Optimization