Parametric Modular Answer Set Programs Made Declarative

2026-05-21

AI Summary

First-order Answer Set Programming (ASP) lacks systematic support for modular and parameterized subroutines, hindering structured program design. This work proposes a formal framework for parameterized modular logic programs, introducing for the first time a parameterization mechanism and intensional declarations into modular ASP. By means of precise semantic mappings, it faithfully captures the collective control mechanisms employed in clingo. The approach establishes a theoretical foundation for modular ASP while enabling declarative definition, reuse, and clear semantics for modules. Consequently, it effectively bridges the gap between modularity and traditional ASP, demonstrating strong expressiveness and practical utility in program structuring and instantiation.

Abstract

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.

Problem

• modularity
• answer set programming
• parametric modules
• first-order logic
• declarative programming

Innovation

• parametric modular logic programs
• answer set programming
• modularity
• collective control
• declarative programming