ModelCounting.org aims to provide a venue for researchers working on model counting such as model counting (mc), weighted model counting/sum of products (wmc), projected model counting (pmc) within the realm but not restricting to Boolean satisfiability (SAT), satisfiability modulo theories (SMT), Answer set programming (ASP), and constraint programming (CP). It encourages to meet, communicate, and discuss the latest theoretical and practical results, in particular results on novel solvers, related solver technologies, new theoretical advances, practical academic and industrial applications as well as the linking theory and practice.
The competition intends to deepen the relationship between latest theoretical and practical development on the various model counting problems and their practical applications. We aim to identify new challenging benchmarks and to promote new solvers for the problem as well as to compare them with state-of-the-art solvers. Model counting is very vibrant field that provided both recent advances in theory as well as in practical solving including various applications. State-of-the-art SAT or WMC (weighted model counting) search engines rely on various techniques such as SAT-based solving, knowledge compilation, or approximate solving by means of sampling using SAT solvers. There have been also successful implementations for parallel and distributed computation as well as massively parallel computation approaches.
Organized workshops provide a place for developers of model counters to present their solvers, for organizers to provide detailed results on the model counting competition, for users of tools in the realm of model counting to illustrate their applications, and for theoretical researchers to present latest results on solving.
MC 2021 follows a direction in the community of constraint solving, where already many competitions have been organized such as on ASP (7 editions), CSP (19 editions), SAT (19 editions), SMT (14 editions), MaxSAT Evaluation (13 editions), QBF (8 editions).
Martin Josef Geiger keeps a nice list of various other computational challenges out there.