In this article, the Program Committee of the Second Parameterized Algorithms and
Computational Experiments challenge (PACE 2017) reports on the second iteration of the …

In the last decade, there has been increasing interest in extensions of answer set
programming (ASP) that cater for quantitative information such as weights or probabilities. A …

Probabilistic reasoning, parameter learning, and most probable explanation inference for
answer set programming have recently received growing attention. They are only some of …

Abstract Answer Set Programming (ASP) is a paradigm for modeling and solving problems
for knowledge representation and reasoning. There are plenty of results dedicated to …

The organizers of the 4th Parameterized Algorithms and Computational Experiments
challenge (PACE 2019) report on the 4th iteration of the PACE challenge. This year, the first …

We propose a unifying dynamic-programming framework to compute exact literal-weighted
model counts of formulas in conjunctive normal form. At the center of our framework are …

Bounded treewidth is one of the most cited combinatorial invariants in the literature. It was
also applied for solving several counting problems efficiently. A canonical counting problem …

In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC
asks to count solutions of a Boolean formula with respect to a given set of projection …

Answer set programming is a form of declarative programming widely used to solve difficult
search problems. Probabilistic applications however require to go beyond simple search for …

Treewidth is one of the most prominent structural parameters. While numerous theoretical
results establish tractability under the assumption of fixed treewidth, the practical success of …