Parametric Modular Answer Set Programs Made Declarative

TL;DR

This paper introduces parametric modular logic programs in answer set programming, enabling structured, parameterized subprograms with formal semantics, bridging modular and traditional ASP.

Contribution

It presents a novel formalism for modular ASP with parameters, capturing collective control semantics and connecting to traditional non-modular ASP.

Findings

Formalism captures semantics of collective control in ASP

Provides theoretical foundations for modular ASP

Connects modular and traditional ASP frameworks

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.