Given a Boolean formula F, the problem of model counting, also referred to as# SAT, seeks
to compute the number of solutions of F. Model counting is a fundamental problem with a …

Many computational problems in modern society account to probabilistic reasoning,
statistics, and combinatorics. A variety of these real-world questions can be solved by …

Given a Boolean formula φ over the set of variables X and a projection set P⊆ X, then if I⊆
P is independent support of P, then if two solutions of φ agree on I, then they also agree on …

We present a recursive algorithm for projected model counting, ie, the problem consisting in
determining the number of models k∃ X. Σk of a propositional formula Σ after eliminating …

Quantitative extensions of logic programming often require the solution of so called second
level inference tasks, that is, problems that involve a third operation, such as maximization or …

Although propositional model counting (# SAT) was long considered too hard to be practical,
today's highly efficient solvers facilitate applications in probabilistic reasoning, reliability …

SharpSAT-TD is a recently published exact model counter that performed exceptionally well
in the recent editions of the Model Counting Competition (https://mccompetition. org/) …

Dependency stochastic Boolean satisfiability (DSSAT) generalizes stochastic Boolean
satisfiability (SSAT) in existential variables being Henkinized allowing their dependencies …

Abstract Model counting, or counting solutions of a set of constraints, is a fundamental
problem in Computer Science with diverse applications. Since exact counting is …

Configurable systems often contain components from different fields or disciplines that are
relevant for distinct stakeholders. For instance, tests or analyses targeting interactions of the …