Many computational problems in modern society account to probabilistic reasoning, statistics, and combinatorics. A variety of these real-world questions can be solved by representing the question in (Boolean) formulas and associating the number of models of the formula directly with the answer to the question. Since there has been an increasing interest in practical problem solving for model counting over the last years, the Model Counting (MC) Competition was conceived in fall 2019. The competition aims to foster applications, identify new challenging benchmarks, and to promote new solvers and improve established solvers for the model counting problem and versions thereof. We hope that the results can be a good indicator of the current feasibility of model counting and spark many new applications. In this paper, we report on details of the Model Counting Competition 2020, about carrying out the competition, and the results. The competition encompassed three versions of the model counting problem, which we evaluated in separate tracks. The first track featured the model counting problem (MC), which asks for the number of models of a given Boolean formula. On the second track, we challenged developers to submit programs that solve the weighted model counting problem (WMC). The last track was dedicated to projected model counting (PMC). In total, we received a surprising number of 9 solvers in 34 versions from 8 groups.
翻译:现代社会的许多计算问题都是根据概率推理、统计和组合的推理、统计和组合分析造成的。这些现实世界问题中的各种问题可以通过在(Boolean)公式中代表问题和将公式的模型数目直接与问题的答案联系起来来解决。由于过去几年来人们越来越关心如何实际解决模型计算的实际问题,2019年秋季设计了模型计算(MC)竞争。竞争的目的是促进应用,确定新的具有挑战性的基准,促进新的解决者,并改进模型计算问题及其版本的既定解决者。我们希望这些结果能够成为目前模型计算和触发许多新应用的可行性的良好指标。在本文中,我们报告了模型计算2020年模型的详情,关于竞争的进行,以及结果。竞争包括三个模型计算问题版本,我们在不同的轨道上进行了评估。第一轨道是模型计算问题(MC),它要求给定的Boolean公式的模型数目。在第二轨道上,我们要求开发者提交一个模型,用以解决模型计算和触发许多新应用。在预测的34MC中,最后轨道是我们所预测的模型计数组。