Parametric Modular Answer Set Programs Made Declarative
人工智能
2026-05-22 v1 计算机科学中的逻辑
摘要
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.
引用
@article{arxiv.2605.22716,
title = {Parametric Modular Answer Set Programs Made Declarative},
author = {Jorge Fandinno and Yuliya Lierler and Torsten Schaub},
journal= {arXiv preprint arXiv:2605.22716},
year = {2026}
}
备注
To appear in Theory and Practice of Logic Programming