Parametric Modular Answer Set Programs Made Declarative

Authors

• Jorge Fandinno, University of Nebraska at OmahaFollow
• Yuliya Lierler, University of Nebraska at OmahaFollow
• Torsten Schaub, University of Potsdam

Document Type

Article

Publication Date

6-29-2026

Publication Title

Theory and Practice of Logic Programming

Volume

First View

First Page

1

Last Page

16

DOI

https://doi.org/10.1017/S1471068426100520

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.

Accessibility Statement

PDF passed Adobe accessibility checker prior to upload.

Comments

This article was published under the library's Cambridge University Press Open Access Agreement. 

Recommended Citation

Fandinno, Jorge; Lierler, Yuliya; and Schaub, Torsten, "Parametric Modular Answer Set Programs Made Declarative" (2026). Computer Science Faculty Publications. 109.
https://digitalcommons.unomaha.edu/compscifacpub/109

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.