# Counting Answer Sets via Dynamic Programming

arXiv: https://arxiv.org/abs/1612.07601 · HTML: https://mlsanity.com/paper/1612.07601/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Dec 2016.

## Built on by (most cited first, 1 of 1)

- [Unit Testing in ASP Revisited: Language and Test-Driven Development Environment](https://mlsanity.com/paper/2401.02153/) (2024)

## Abstract (arXiv)

While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving paradigms like answer set programming (ASP). Although ASP solvers are designed to enumerate all solutions, and counting can therefore be easily done, the involved materialization of all solutions is a clear bottleneck for the counting problem of ASP (#ASP). In this paper we propose dynamic programming-based #ASP algorithms that exploit the structure of the underlying (ground) ASP program. Experimental results for a prototype implementation show promise when compared to existing solvers.