In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance. To this aim, we use a formal specification language based on ASP modules, so that each module can be proved to capture some informal aspect of the problem in an isolated way. This specification language relies on a novel definition of (possibly nested, first order) program modules that may incorporate local hidden atoms at different levels. Then, verifying the logic program P amounts to prove some kind of equivalence between P and its modular specification.

中文翻译：

---

模块化答案集编程作为正式规范语言

在本文中，我们研究了答案集编程（ASP）的形式验证问题，即获得一个形式证明显示给定（非地面）逻辑程序的答案集磷正确对应于由编码的问题的解决方案磷，无论问题实例如何。为此，我们使用基于 ASP 模块的正式规范语言，以便可以证明每个模块以孤立的方式捕获问题的一些非正式方面。该规范语言依赖于（可能是嵌套的，一阶的）的新定义程序模块可能包含不同层次的局部隐藏原子。然后，验证逻辑程序磷相当于证明之间的某种等价性磷及其模块化规范。