Revisiting Explicit Negation in Answer Set Programming. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: AGUADO, FELICIDAD; CABALAR, PEDRO; FANDINNO, JORGE; PEARCE, DAVID; PÉREZ, GILBERTO; VIDAL, CONCEPCIÓN
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 908
• Page End: 924
• Publication Date: 2019-09
• Subjects: Answer set programming, -- Non-monotonic reasoning, -- Equilibrium logic, -- Explicit negation; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000267
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson's strong negation.