Program completion in the input language of GRINGO*

We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the "reverse engineering" process of generating a set of conditions that could serve as a specification for it. Accordingly, it may be useful to define completion for a large class of ASP programs and to automate the process of generating and simplifying completion formulas. Examining the output produced by this kind of software may help programmers to see more clearly what their program does, and to what degree its behavior conforms with their expectations. As a step toward this goal, we propose here a definition of program completion for a large class of programs in the input language of the ASP grounder GRINGO, and study its properties. This note is under consideration for publication in Theory and Practice of Logic Programming.

[1]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

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

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

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

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

[6]  Joohyung Lee,et al.  Stable Models of Formulas with Generalized Quantifiers , 2012 .

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

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

[9]  Fangkai Yang,et al.  The Semantics of Gringo and Infinitary Propositional Formulas , 2014, KR.

[10]  David Pearce,et al.  Infinitary Equilibrium Logic and Strong Equivalence , 2015, LPNMR.

[11]  Vladimir Lifschitz,et al.  Mathematical Foundations of Answer Set Programming , 2005, We Will Show Them!.

[12]  Fangkai Yang,et al.  Lloyd-Topor completion and general stable models , 2013, Theory and Practice of Logic Programming.

[13]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[14]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[15]  Paolo Ferraris and Vladimir Lifschitz.  On the Stable Model Semantics of First-Order Formulas with Aggregates , 2010 .

[16]  Joohyung Lee,et al.  On Reductive Semantics of Aggregates in Answer Set Programming , 2009, LPNMR.