
























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.
| Comments: | To appear in Theory and Practice of Logic Programming |
| Subjects: | Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO) |
| Cite as: | arXiv:2605.22716 [cs.AI] |
| (or arXiv:2605.22716v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2605.22716 arXiv-issued DOI via DataCite (pending registration) |
From: Jorge Fandinno [view email]
[v1]
Thu, 21 May 2026 16:52:18 UTC (39 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。