Parametric Modular Answer Set Programs Made Declarative
This work addresses the need for modularity in ASP for practitioners, but it is incremental as it formalizes existing features.
The paper introduces parametric modular logic programs to enable modularity in first-order answer set programming (ASP), capturing the semantics of clingo-programs with collective control and providing theoretical foundations for modular ASP.
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.