# Diminution: On Reducing the Size of Grounding ASP Programs

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 53 references that are in the map.
- First posted on arXiv 12 Aug 2025.

## Builds on (most cited first, 4 of 4)

- [VirtualHome: Simulating Household Activities via Programs](https://mlsanity.com/paper/1806.07011/) (2018)
- [Multi-shot ASP solving with clingo](https://mlsanity.com/paper/1705.09811/) (2017)
- [Experimenting with robotic intra-logistics domains](https://mlsanity.com/paper/1804.10247/) (2018)
- [Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase Saving, Heuristics, and More](https://mlsanity.com/paper/2008.03526/) (2020)

## Abstract (arXiv)

Answer Set Programming (ASP) is often hindered by the grounding bottleneck: large Herbrand universes generate ground programs so large that solving becomes difficult. Many methods employ ad-hoc heuristics to improve grounding performance, motivating the need for a more formal and generalizable strategy. We introduce the notion of diminution, defined as a selected subset of the Herbrand universe used to generate a reduced ground program before solving. We give a formal definition of diminution, analyze its key properties, and study the complexity of identifying it. We use a specific encoding that enables off-the-shelf ASP solver to evaluate candidate subsets. Our approach integrates seamlessly with existing grounders via domain predicates. In extensive experiments on five benchmarks, applying diminutions selected by our strategy yields significant performance improvements, reducing grounding time by up to 70% on average and decreasing the size of grounding files by up to 85%. These results demonstrate that leveraging diminutions constitutes a robust and general-purpose approach for alleviating the grounding bottleneck in ASP.