Mostrar o rexistro simple do ítem
Revisiting Explicit Negation in Answer Set Programming
dc.contributor.author | Aguado, Felicidad | |
dc.contributor.author | Cabalar, Pedro | |
dc.contributor.author | Fandiño, Jorge | |
dc.contributor.author | Pearce, David | |
dc.contributor.author | Pérez, Gilberto | |
dc.contributor.author | Vidal, Concepción | |
dc.date.accessioned | 2019-10-24T18:07:00Z | |
dc.date.available | 2019-10-24T18:07:00Z | |
dc.date.issued | 2019-09 | |
dc.identifier.citation | AGUADO, F., CABALAR, P., FANDINNO, J., PEARCE, D., PÉREZ, G., & VIDAL, C. (2019). Revisiting Explicit Negation in Answer Set Programming. Theory and Practice of Logic Programming, 19(5-6), 908-924. doi:10.1017/S1471068419000267 | es_ES |
dc.identifier.issn | 1475-3081 | |
dc.identifier.issn | 1471-0684 | |
dc.identifier.uri | http://hdl.handle.net/2183/24189 | |
dc.description.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. | es_ES |
dc.description.sponsorship | Ministerio de Economía y Competitividad; TIC2017-84453-P | es_ES |
dc.description.sponsorship | Xunta de Galicia; GPC ED431B 2019/03 | es_ES |
dc.description.sponsorship | Xunta de Galicia; 2016-2019 ED431G/01, CITIC | es_ES |
dc.description.sponsorship | Centre International de Math´ematiques et d’Informatique de Toulouse; ANR-11-LABEX-0040 | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Cambridge University Press | es_ES |
dc.relation.uri | https://doi.org/10.1017/S1471068419000267 | es_ES |
dc.rights | Atribución 3.0 España | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
dc.subject | Answer set programming | es_ES |
dc.subject | Non-monotonic reasoning | es_ES |
dc.subject | Equilibrium logic | es_ES |
dc.subject | Explicit negation | es_ES |
dc.title | Revisiting Explicit Negation in Answer Set Programming | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.access | info:eu-repo/semantics/openAccess | es_ES |
UDC.journalTitle | Theory and Practice of Logic Programming | es_ES |
UDC.volume | 19 | es_ES |
UDC.issue | Special Issue 5-6 (35th International Conference on Logic Programming) | es_ES |
UDC.startPage | 908 | es_ES |
UDC.endPage | 924 | es_ES |
dc.identifier.doi | 10.1017/S1471068419000267 | |
UDC.conferenceTitle | 35th International Conference on Logic Programming | es_ES |
Ficheiros no ítem
Este ítem aparece na(s) seguinte(s) colección(s)
-
GI-IRlab-Artigos [31]