Efficient Incremental #SAT via Cross-Instance Knowledge Reuse

Model counting (#SAT) is a fundamental yet #P-complete problem central to probabilistic reasoning.

In this work, we address incremental model counting, where sequences of structurally similar formulas must be counted.

We propose an approach that amortizes computation via a persistent caching mechanism, retaining component data across solver calls to avoid redundant search. Additionally, we investigate branching heuristics adapted for this setting. We focus on the problems of argumentation and soft core, for which incremental model counting is natural.

Experiments demonstrate that our method improves performance compared to current model counters, highlighting the capability of structure-aware reuse in dynamic environments.