Propositional Model Counting
||Propositional Model Counting|
||NAISS Medium Compute|
||Johannes Klaus Fichte <firstname.lastname@example.org>|
||2023-10-30 – 2024-05-01|
||10201 10105 10103|
Propositional model counting (MC), also known as number SAT or #SAT, asks to output the number of models of a propositional formula. Despite its computational hardness, the field has seen considerable advances in recent years and highly efficient solvers emerged, capable of solving larger problems each year. These solvers have immediate use in various domains, such as formal verification of hardware, software, and security protocols, combinatorial optimization, computational mathematics, or artificial intelligence in general. Over the last few years, various applications can be witnessed in the literature. Due to the increasing practical interest in counting, the Model Counting Competition (MCC) was conceived in October 2019 and four iterations have successfully carried out. The 5th iteration is planned for 2024 and will be part of the 26th International Conference on Theory and Applications of Satisfiability Testing. The competition identifies new challenging applications and benchmarks, promotes fast and reliable solvers for the problem, and provides a neutral comparison of state-of-the-art solvers. The result of the competition will be a good indicator of the current feasibility of model counting for various applications.