Parametric Modular Answer Set Programs Made Declarative

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.

To appear in Theory and Practice of Logic Programming

References in corpus (5)

• Verifying Tight Logic Programs with anthem and Vampire
• Modular Answer Set Programming as a Formal Specification Language
• SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic
• Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)
• Anthem 2.0: Automated Reasoning for Answer Set Programming