Program completion in the input language of GRINGO*. Issue 5 (23rd August 2017)

• Record Type: Journal Article
• Authors: HARRISON, AMELIA; LIFSCHITZ, VLADIMIR; RAJU, DHANANJAY
• Editors: Rocha, Ricardo; Cao Son, Tran
• Is Part Of: Theory and practice of logic programming. Volume 17:Issue 5/6(2017)
• Page Start: 855
• Page End: 871
• Publication Date: 2017-08-23
• Subjects: formal methods, -- program completion, -- Answer Set Programming; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068417000394
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: 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 Answer Set Programming (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 groundergringo, and study its properties.