Verifying Tight Logic Programs with anthem and vampire

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.

[1]  David Pearce,et al.  Infinitary equilibrium logic and strongly equivalent logic programs , 2017, Artif. Intell..

[2]  Joohyung Lee,et al.  Symmetric Splitting in the General Theory of Stable Models , 2009, IJCAI.

[3]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2017, Journal of Automated Reasoning.

[4]  Joohyung Lee,et al.  A Reductive Semantics for Counting and Choice in Answer Set Programming , 2008, AAAI.

[5]  Vladimir Lifschitz,et al.  Program completion in the input language of GRINGO* , 2017, Theory and Practice of Logic Programming.

[6]  Torsten Schaub,et al.  Towards Verifying Logic Programs in the Input Language of clingo , 2020, Fields of Logic and Computation III.

[7]  Miroslaw Truszczynski,et al.  Connecting First-Order ASP and the Logic FO(ID) through Reducts , 2012, Correct Reasoning.

[8]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[9]  Torsten Schaub,et al.  anthem: Transforming gringo Programs into First-Order Theories (Preliminary Report) , 2018, ArXiv.

[10]  Michael Gelfond,et al.  Towards a Theory of Elaboration Tolerance: Logic Programming Approach , 1996, Int. J. Softw. Eng. Knowl. Eng..

[11]  Torsten Schaub,et al.  Verifying Strong Equivalence of Programs in the Input Language of gringo , 2019, LPNMR.

[12]  Martin Gebser,et al.  Abstract gringo , 2015, Theory Pract. Log. Program..

[13]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

[14]  Jorge Fandinno,et al.  Modular Answer Set Programming as a Formal Specification Language , 2020, Theory Pract. Log. Program..

[15]  Joohyung Lee,et al.  Stable models and circumscription , 2011, Artif. Intell..

[16]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[17]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[18]  Dov M. Gabbay,et al.  What Is Negation as Failure? , 2012, Logic Programs, Norms and Action.

[19]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[20]  Tomi Janhunen,et al.  A Translation-based Approach to the Verification of Modular Equivalence , 2009, J. Log. Comput..

[21]  Esra Erdem,et al.  Tight logic programs , 2003, Theory and Practice of Logic Programming.