Relating Two Dialects of Answer Set Programming. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: HARRISON, AMELIA; LIFSCHITZ, VLADIMIR
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 1006
• Page End: 1020
• Publication Date: 2019-09
• Subjects: Answer set programming, -- answer set solvers, -- stable models, -- aggregates; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000322
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: The input language of the answer set solverclingo is based on the definition of a stable model proposed by Paolo Ferraris. The semantics of the ASP-Core language, developed by the ASP Standardization Working Group, uses the approach to stable models due to Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. The two languages are based on different versions of the stable model semantics, and the ASP-Core document requires, "for the sake of an uncontroversial semantics, " that programs avoid the use of recursion through aggregates. In this paper we prove that the absence of recursion through aggregates does indeed guarantee the equivalence between the two versions of the stable model semantics, and show how that requirement can be relaxed without violating the equivalence property.