The Model Counting Competition 2020

Author:

Fichte Johannes K.1,Hecher Markus2ORCID,Hamiti Florim1

Affiliation:

1. Faculty of Computer Science, School of Engineering Sciences, TU Dresden, Germany

2. Logic and Computation, Database and Artificial Intelligence Group, TU Wien, Austria

Abstract

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 past years, the Model Counting Competition was conceived in fall 2019. The competition aims to foster applications, identify new challenging benchmarks, and 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 article, 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, 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. The last track was dedicated to projected model counting. In total, we received a surprising number of nine solvers in 34 versions from eight groups.

Funder

Austrian Science Fund

Vienna Science and Technology Fund

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science

Reference86 articles.

1. Hailfinder: A Bayesian system for forecasting severe weather

2. The Community Structure of SAT Formulas

3. Fahiem Bacchus Matti Järvisalo and Ruben Martins. 2019. MaxSAT Evaluation 2019. Retrieved August 7 2021 from https://maxsat-evaluations.github.io/2019/. Fahiem Bacchus Matti Järvisalo and Ruben Martins. 2019. MaxSAT Evaluation 2019. Retrieved August 7 2021 from https://maxsat-evaluations.github.io/2019/.

4. Benchmarking and Resource Measurement

5. Reliable benchmarking: requirements and solutions

Cited by 16 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. International Competition on Graph Counting Algorithms 2023;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2024-09-01

2. Ising model partition-function computation as a weighted counting problem;Physical Review E;2024-05-06

3. aspmc: New frontiers of algebraic answer set counting;Artificial Intelligence;2024-05

4. IASCAR: Incremental Answer Set Counting by Anytime Refinement;Theory and Practice of Logic Programming;2024-02-21

5. The Silent (R)evolution of SAT;Communications of the ACM;2023-05-24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3