# Parametric Modular Answer Set Programs Made Declarative

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 10 of its 22 references that are in the map.
- First posted on arXiv 21 May 2026.

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

- [Multi-shot ASP solving with clingo](https://mlsanity.com/paper/1705.09811/) (2017)
- [Verifying Tight Logic Programs with anthem and Vampire](https://mlsanity.com/paper/2008.02025/) (2020)
- [Modularity Aspects of Disjunctive Stable Models](https://mlsanity.com/paper/1401.3484/) (2014)
- [Modular Answer Set Programming as a Formal Specification Language](https://mlsanity.com/paper/2008.02015/) (2020)
- [plasp 3: Towards Effective ASP Planning](https://mlsanity.com/paper/1812.04491/) (2018)
- [Verification of Locally Tight Programs](https://mlsanity.com/paper/2204.10789/) (2022)
- [Anthem 2.0: Automated Reasoning for Answer Set Programming](https://mlsanity.com/paper/2507.11704/) (2025)
- [First-Order Modular Logic Programs and their Conservative Extensions](https://mlsanity.com/paper/1608.02681/) (2016)
- [Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)](https://mlsanity.com/paper/2503.19762/) (2025)
- [SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic](https://mlsanity.com/paper/2511.01753/) (2025)

## Abstract (arXiv)

In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality statements. We demonstrate how this formalism can capture the semantics of clingo-programs with collective control, a feature that enables structuring and instantiating subprograms. We provide theoretical foundations for modular ASP, illustrate its usefulness, and connect to traditional non-modular ASP.