Revisiting Explicit Negation in Answer Set Programming
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. Under consideration for acceptance in TPLP.
Keywords
Cite
@article{arxiv.1907.11467,
title = {Revisiting Explicit Negation in Answer Set Programming},
author = {Felicidad Aguado and Pedro Cabalar and Jorge Fandinno and David Pearce and Gilberto Perez and Concepcion Vidal},
journal= {arXiv preprint arXiv:1907.11467},
year = {2020}
}
Comments
Paper presented at the 35th International Conference on Logic Programming (ICLP 2019), Las Cruces, New Mexico, USA, 20-25 September 2019, 16 pages