This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas. Under consideration for acceptance in TPLP.
翻译:本文继续研究逻辑程序与一阶理论之间的关系。我们把方案完成的定义扩大到有投入和输出的ASP地面格外格的一组输入语言的方案,研究在这方面稳定模型与完成之间的关系,并描述使用两种软件工具(国歌和吸血鬼)进行的初步实验,以核实程序与输入和输出的正确性。理论的证明是基于将本文件所研究的方案的语义与一阶公式的稳定模型联系起来的列马。正在考虑在TPLP中接受。