mlsanityData to 7 Oct 2026

Parametric Modular Answer Set Programs Made Declarative

arXiv 2605.22716 ↗First posted 21 May 2026cs.AI cs.LOcited by 0

Not on the map. Why?

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.

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

Builds on

10 of 22 references.

References · 10

  1. 2017Multi-shot ASP solving with clingocited by 115
  2. 2020Verifying Tight Logic Programs with anthem and Vampirecited by 13
  3. 2014Modularity Aspects of Disjunctive Stable Modelscited by 8
  4. 2020Modular Answer Set Programming as a Formal Specification Languagecited by 7
  5. 2018plasp 3: Towards Effective ASP Planningcited by 6
  6. 2022Verification of Locally Tight Programscited by 3
  7. 2025Anthem 2.0: Automated Reasoning for Answer Set Programmingcited by 2
  8. 2016First-Order Modular Logic Programs and their Conservative Extensionscited by 1
  9. 2025Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)cited by 1
  10. 2025SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmeticcited by 1

Built on by

Not cited yet.